/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 00:49:50,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 00:49:50,192 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 00:49:50,216 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 00:49:50,217 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 00:49:50,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 00:49:50,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 00:49:50,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 00:49:50,221 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 00:49:50,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 00:49:50,222 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 00:49:50,223 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 00:49:50,223 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 00:49:50,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 00:49:50,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 00:49:50,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 00:49:50,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 00:49:50,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 00:49:50,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 00:49:50,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 00:49:50,229 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 00:49:50,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 00:49:50,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 00:49:50,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 00:49:50,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 00:49:50,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 00:49:50,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 00:49:50,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 00:49:50,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 00:49:50,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 00:49:50,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 00:49:50,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 00:49:50,236 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 00:49:50,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 00:49:50,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 00:49:50,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 00:49:50,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 00:49:50,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 00:49:50,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 00:49:50,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 00:49:50,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 00:49:50,240 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-RepeatedSemanticLbe.epf [2022-12-13 00:49:50,259 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 00:49:50,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 00:49:50,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 00:49:50,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 00:49:50,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 00:49:50,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 00:49:50,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:50,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 00:49:50,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 00:49:50,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 00:49:50,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 00:49:50,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 00:49:50,262 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 00:49:50,262 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 00:49:50,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 00:49:50,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 00:49:50,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 00:49:50,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 00:49:50,532 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 00:49:50,532 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 00:49:51,499 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 00:49:51,746 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 00:49:51,746 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 00:49:51,760 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7522d900a/7534278bd1c84074aa374335039cd137/FLAG90e564a47 [2022-12-13 00:49:51,774 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7522d900a/7534278bd1c84074aa374335039cd137 [2022-12-13 00:49:51,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 00:49:51,777 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 00:49:51,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:51,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 00:49:51,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 00:49:51,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:51" (1/1) ... [2022-12-13 00:49:51,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be8fb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:51, skipping insertion in model container [2022-12-13 00:49:51,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:49:51" (1/1) ... [2022-12-13 00:49:51,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 00:49:51,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 00:49:51,939 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 00:49:52,073 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,076 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,083 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,090 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,091 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:52,135 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 00:49:52,144 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i[978,991] [2022-12-13 00:49:52,167 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,168 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,169 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,182 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 00:49:52,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 00:49:52,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 00:49:52,243 INFO L208 MainTranslator]: Completed translation [2022-12-13 00:49:52,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52 WrapperNode [2022-12-13 00:49:52,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 00:49:52,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:52,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 00:49:52,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 00:49:52,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,306 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-12-13 00:49:52,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 00:49:52,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 00:49:52,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 00:49:52,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 00:49:52,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,336 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 00:49:52,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 00:49:52,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 00:49:52,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 00:49:52,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (1/1) ... [2022-12-13 00:49:52,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 00:49:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 00:49:52,384 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 00:49:52,392 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 00:49:52,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 00:49:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 00:49:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 00:49:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 00:49:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 00:49:52,415 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 00:49:52,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 00:49:52,416 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 00:49:52,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 00:49:52,416 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 00:49:52,416 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 00:49:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 00:49:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 00:49:52,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 00:49:52,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 00:49:52,419 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 00:49:52,582 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 00:49:52,583 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 00:49:52,812 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 00:49:52,892 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 00:49:52,892 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 00:49:52,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:52 BoogieIcfgContainer [2022-12-13 00:49:52,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 00:49:52,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 00:49:52,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 00:49:52,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 00:49:52,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:49:51" (1/3) ... [2022-12-13 00:49:52,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187d35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:52, skipping insertion in model container [2022-12-13 00:49:52,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:49:52" (2/3) ... [2022-12-13 00:49:52,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1187d35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:49:52, skipping insertion in model container [2022-12-13 00:49:52,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:49:52" (3/3) ... [2022-12-13 00:49:52,899 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2022-12-13 00:49:52,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 00:49:52,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 00:49:52,911 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 00:49:52,946 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 00:49:52,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:49:53,021 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:49:53,021 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:53,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:49:53,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-13 00:49:53,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-13 00:49:53,029 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:53,042 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:49:53,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-13 00:49:53,063 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-13 00:49:53,063 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:53,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-13 00:49:53,066 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-13 00:49:53,066 INFO L226 LiptonReduction]: Number of co-enabled transitions 1920 [2022-12-13 00:49:57,714 INFO L241 LiptonReduction]: Total number of compositions: 81 [2022-12-13 00:49:57,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 00:49:57,740 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;@43d79efc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 00:49:57,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 00:49:57,743 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 00:49:57,743 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:57,743 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:57,744 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 00:49:57,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 485890, now seen corresponding path program 1 times [2022-12-13 00:49:57,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:57,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285130981] [2022-12-13 00:49:57,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:58,029 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 00:49:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:58,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285130981] [2022-12-13 00:49:58,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285130981] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:58,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:58,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:49:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443953913] [2022-12-13 00:49:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:58,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:49:58,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:58,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:49:58,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:49:58,057 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 67 [2022-12-13 00:49:58,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:49:58,059 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:58,059 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 67 [2022-12-13 00:49:58,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:49:59,224 INFO L130 PetriNetUnfolder]: 7640/12359 cut-off events. [2022-12-13 00:49:59,224 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 00:49:59,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23372 conditions, 12359 events. 7640/12359 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 93730 event pairs, 1000 based on Foata normal form. 0/7794 useless extension candidates. Maximal degree in co-relation 23361. Up to 9285 conditions per place. [2022-12-13 00:49:59,256 INFO L137 encePairwiseOnDemand]: 61/67 looper letters, 34 selfloop transitions, 2 changer transitions 60/107 dead transitions. [2022-12-13 00:49:59,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 417 flow [2022-12-13 00:49:59,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:49:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:49:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-12-13 00:49:59,264 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2022-12-13 00:49:59,265 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 143 flow. Second operand 3 states and 140 transitions. [2022-12-13 00:49:59,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 417 flow [2022-12-13 00:49:59,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 412 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:49:59,269 INFO L231 Difference]: Finished difference. Result has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:59,270 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=72, PETRI_TRANSITIONS=32} [2022-12-13 00:49:59,273 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -3 predicate places. [2022-12-13 00:49:59,273 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:49:59,274 INFO L89 Accepts]: Start accepts. Operand has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:59,276 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:49:59,276 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:49:59,276 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 32 transitions, 74 flow [2022-12-13 00:49:59,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:59,280 INFO L130 PetriNetUnfolder]: 0/32 cut-off events. [2022-12-13 00:49:59,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 00:49:59,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 74 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-13 00:49:59,282 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:59,282 INFO L226 LiptonReduction]: Number of co-enabled transitions 574 [2022-12-13 00:49:59,371 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:49:59,374 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 101 [2022-12-13 00:49:59,374 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 74 flow [2022-12-13 00:49:59,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:49:59,374 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:49:59,374 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:49:59,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 00:49:59,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:49:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:49:59,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1527177077, now seen corresponding path program 1 times [2022-12-13 00:49:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:49:59,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586063634] [2022-12-13 00:49:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:49:59,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:49:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:49:59,990 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 00:49:59,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:49:59,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586063634] [2022-12-13 00:49:59,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586063634] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:49:59,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:49:59,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:49:59,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630111983] [2022-12-13 00:49:59,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:49:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:49:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:49:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:49:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:49:59,993 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2022-12-13 00:49:59,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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 00:49:59,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:49:59,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2022-12-13 00:49:59,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:00,282 INFO L130 PetriNetUnfolder]: 1836/2838 cut-off events. [2022-12-13 00:50:00,282 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-12-13 00:50:00,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5742 conditions, 2838 events. 1836/2838 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 14320 event pairs, 346 based on Foata normal form. 55/2451 useless extension candidates. Maximal degree in co-relation 5732. Up to 2086 conditions per place. [2022-12-13 00:50:00,294 INFO L137 encePairwiseOnDemand]: 23/32 looper letters, 37 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2022-12-13 00:50:00,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 210 flow [2022-12-13 00:50:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-13 00:50:00,295 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6484375 [2022-12-13 00:50:00,295 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 74 flow. Second operand 4 states and 83 transitions. [2022-12-13 00:50:00,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 210 flow [2022-12-13 00:50:00,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:00,297 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 130 flow [2022-12-13 00:50:00,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2022-12-13 00:50:00,298 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -30 predicate places. [2022-12-13 00:50:00,298 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:00,298 INFO L89 Accepts]: Start accepts. Operand has 45 places, 38 transitions, 130 flow [2022-12-13 00:50:00,298 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:00,298 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:00,298 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 130 flow [2022-12-13 00:50:00,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 38 transitions, 130 flow [2022-12-13 00:50:00,320 INFO L130 PetriNetUnfolder]: 131/287 cut-off events. [2022-12-13 00:50:00,320 INFO L131 PetriNetUnfolder]: For 28/35 co-relation queries the response was YES. [2022-12-13 00:50:00,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 287 events. 131/287 cut-off events. For 28/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1469 event pairs, 66 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 588. Up to 190 conditions per place. [2022-12-13 00:50:00,322 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 130 flow [2022-12-13 00:50:00,322 INFO L226 LiptonReduction]: Number of co-enabled transitions 630 [2022-12-13 00:50:00,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [339] L794-->L801: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_26 256) 0)))) (let ((.cse2 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_115 256) 0)))) (.cse3 (and .cse5 .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_132 256) 0)) .cse5))) (and (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_27 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_114 256) 0)))) 0 v_~z$r_buff1_thd3~0_26) v_~z$r_buff1_thd3~0_25) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_115) v_~z$w_buff1_used~0_114) (= v_~z~0_73 (ite .cse4 v_~z$w_buff0~0_55 (ite .cse2 v_~z$w_buff1~0_58 v_~z~0_74))) (= (ite .cse3 0 v_~z$r_buff0_thd3~0_28) v_~z$r_buff0_thd3~0_27) (= v_~z$w_buff0_used~0_131 (ite .cse4 0 v_~z$w_buff0_used~0_132))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_115, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_74} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_73} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-13 00:50:00,471 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:50:00,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [410] L2-1-->L834: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_88 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_88 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_204 256) 0))))) (and (= v_~z~0_124 (ite .cse0 v_~z$w_buff0~0_115 (ite .cse1 v_~z$w_buff1~0_103 v_~z~0_125))) (= v_~z$r_buff0_thd0~0_87 (ite .cse2 0 v_~z$r_buff0_thd0~0_88)) (= v_~z$w_buff1_used~0_171 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_172)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_87 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_171 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_88) v_~z$r_buff1_thd0~0_87) (= (ite .cse0 0 v_~z$w_buff0_used~0_204) v_~z$w_buff0_used~0_203)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_204, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_125} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_87, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_203, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_124} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:50:00,619 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [324] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [356] $Ultimate##0-->L771: Formula: (and (= v_~x~0_19 2) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x~0=v_~x~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~x~0] [2022-12-13 00:50:00,701 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:00,702 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 404 [2022-12-13 00:50:00,703 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 132 flow [2022-12-13 00:50:00,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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 00:50:00,703 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:00,703 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:00,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 00:50:00,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:00,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:00,703 INFO L85 PathProgramCache]: Analyzing trace with hash 97849925, now seen corresponding path program 1 times [2022-12-13 00:50:00,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:00,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312327007] [2022-12-13 00:50:00,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:50:00,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:00,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312327007] [2022-12-13 00:50:00,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312327007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:00,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:00,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 00:50:00,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32106390] [2022-12-13 00:50:00,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:00,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:00,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:00,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:00,800 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 00:50:00,800 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:00,800 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:00,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 00:50:00,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:01,039 INFO L130 PetriNetUnfolder]: 1385/2199 cut-off events. [2022-12-13 00:50:01,039 INFO L131 PetriNetUnfolder]: For 1416/1444 co-relation queries the response was YES. [2022-12-13 00:50:01,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5703 conditions, 2199 events. 1385/2199 cut-off events. For 1416/1444 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11519 event pairs, 492 based on Foata normal form. 8/1851 useless extension candidates. Maximal degree in co-relation 5690. Up to 1948 conditions per place. [2022-12-13 00:50:01,051 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 36 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-13 00:50:01,051 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 282 flow [2022-12-13 00:50:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:01,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-12-13 00:50:01,054 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-13 00:50:01,054 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 132 flow. Second operand 3 states and 74 transitions. [2022-12-13 00:50:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 282 flow [2022-12-13 00:50:01,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 279 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:01,059 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,059 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-13 00:50:01,060 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -29 predicate places. [2022-12-13 00:50:01,060 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:01,060 INFO L89 Accepts]: Start accepts. Operand has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,061 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:01,061 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:01,062 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,091 INFO L130 PetriNetUnfolder]: 127/297 cut-off events. [2022-12-13 00:50:01,092 INFO L131 PetriNetUnfolder]: For 225/248 co-relation queries the response was YES. [2022-12-13 00:50:01,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 297 events. 127/297 cut-off events. For 225/248 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1616 event pairs, 48 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 672. Up to 186 conditions per place. [2022-12-13 00:50:01,095 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,095 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:50:01,104 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:01,105 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-13 00:50:01,105 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 193 flow [2022-12-13 00:50:01,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:01,105 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:01,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:01,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 00:50:01,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash 786523685, now seen corresponding path program 1 times [2022-12-13 00:50:01,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:01,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195840246] [2022-12-13 00:50:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:01,230 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 00:50:01,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:01,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195840246] [2022-12-13 00:50:01,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195840246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:01,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:01,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539085118] [2022-12-13 00:50:01,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:01,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:01,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:01,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:01,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 00:50:01,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:01,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:01,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 00:50:01,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:01,570 INFO L130 PetriNetUnfolder]: 2167/3418 cut-off events. [2022-12-13 00:50:01,571 INFO L131 PetriNetUnfolder]: For 3417/3417 co-relation queries the response was YES. [2022-12-13 00:50:01,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9136 conditions, 3418 events. 2167/3418 cut-off events. For 3417/3417 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 19210 event pairs, 479 based on Foata normal form. 136/2973 useless extension candidates. Maximal degree in co-relation 9121. Up to 1305 conditions per place. [2022-12-13 00:50:01,584 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 41 selfloop transitions, 3 changer transitions 18/73 dead transitions. [2022-12-13 00:50:01,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 448 flow [2022-12-13 00:50:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:01,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-12-13 00:50:01,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2022-12-13 00:50:01,586 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 193 flow. Second operand 4 states and 100 transitions. [2022-12-13 00:50:01,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 448 flow [2022-12-13 00:50:01,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 441 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:01,589 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,589 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2022-12-13 00:50:01,590 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -25 predicate places. [2022-12-13 00:50:01,591 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:01,591 INFO L89 Accepts]: Start accepts. Operand has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:01,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:01,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,610 INFO L130 PetriNetUnfolder]: 79/232 cut-off events. [2022-12-13 00:50:01,610 INFO L131 PetriNetUnfolder]: For 228/231 co-relation queries the response was YES. [2022-12-13 00:50:01,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 232 events. 79/232 cut-off events. For 228/231 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1305 event pairs, 43 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 516. Up to 121 conditions per place. [2022-12-13 00:50:01,612 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,612 INFO L226 LiptonReduction]: Number of co-enabled transitions 570 [2022-12-13 00:50:01,628 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:01,633 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 42 [2022-12-13 00:50:01,633 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 162 flow [2022-12-13 00:50:01,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:01,634 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:01,634 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:01,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 00:50:01,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:01,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1926084804, now seen corresponding path program 1 times [2022-12-13 00:50:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:01,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140369661] [2022-12-13 00:50:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:01,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 00:50:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:01,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140369661] [2022-12-13 00:50:01,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140369661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:01,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:01,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250916856] [2022-12-13 00:50:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:01,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:01,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:01,870 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 00:50:01,870 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:01,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:01,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 00:50:01,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:02,099 INFO L130 PetriNetUnfolder]: 1361/2120 cut-off events. [2022-12-13 00:50:02,099 INFO L131 PetriNetUnfolder]: For 2796/2796 co-relation queries the response was YES. [2022-12-13 00:50:02,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6144 conditions, 2120 events. 1361/2120 cut-off events. For 2796/2796 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10043 event pairs, 376 based on Foata normal form. 4/1771 useless extension candidates. Maximal degree in co-relation 6126. Up to 1901 conditions per place. [2022-12-13 00:50:02,113 INFO L137 encePairwiseOnDemand]: 32/36 looper letters, 37 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-12-13 00:50:02,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 286 flow [2022-12-13 00:50:02,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-12-13 00:50:02,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-13 00:50:02,114 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 162 flow. Second operand 3 states and 70 transitions. [2022-12-13 00:50:02,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 286 flow [2022-12-13 00:50:02,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 51 transitions, 270 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:02,119 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 167 flow [2022-12-13 00:50:02,119 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2022-12-13 00:50:02,120 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -26 predicate places. [2022-12-13 00:50:02,120 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:02,120 INFO L89 Accepts]: Start accepts. Operand has 49 places, 40 transitions, 167 flow [2022-12-13 00:50:02,121 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:02,121 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:02,121 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 40 transitions, 167 flow [2022-12-13 00:50:02,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 167 flow [2022-12-13 00:50:02,145 INFO L130 PetriNetUnfolder]: 101/288 cut-off events. [2022-12-13 00:50:02,146 INFO L131 PetriNetUnfolder]: For 239/241 co-relation queries the response was YES. [2022-12-13 00:50:02,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 288 events. 101/288 cut-off events. For 239/241 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1700 event pairs, 58 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 622. Up to 147 conditions per place. [2022-12-13 00:50:02,148 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 40 transitions, 167 flow [2022-12-13 00:50:02,148 INFO L226 LiptonReduction]: Number of co-enabled transitions 592 [2022-12-13 00:50:02,165 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:02,166 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:50:02,166 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 171 flow [2022-12-13 00:50:02,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:02,166 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:02,166 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:02,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 00:50:02,166 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -489963221, now seen corresponding path program 1 times [2022-12-13 00:50:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:02,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138772970] [2022-12-13 00:50:02,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:02,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:02,422 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 00:50:02,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138772970] [2022-12-13 00:50:02,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138772970] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:02,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:02,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720671481] [2022-12-13 00:50:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:02,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:02,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:02,424 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2022-12-13 00:50:02,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:02,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:02,424 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2022-12-13 00:50:02,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:02,682 INFO L130 PetriNetUnfolder]: 1424/2230 cut-off events. [2022-12-13 00:50:02,682 INFO L131 PetriNetUnfolder]: For 2514/2524 co-relation queries the response was YES. [2022-12-13 00:50:02,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6442 conditions, 2230 events. 1424/2230 cut-off events. For 2514/2524 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11073 event pairs, 331 based on Foata normal form. 8/1874 useless extension candidates. Maximal degree in co-relation 6425. Up to 1869 conditions per place. [2022-12-13 00:50:02,694 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 48 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2022-12-13 00:50:02,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 393 flow [2022-12-13 00:50:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:02,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2022-12-13 00:50:02,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-13 00:50:02,695 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 171 flow. Second operand 4 states and 96 transitions. [2022-12-13 00:50:02,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 393 flow [2022-12-13 00:50:02,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:02,698 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 230 flow [2022-12-13 00:50:02,698 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2022-12-13 00:50:02,698 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -23 predicate places. [2022-12-13 00:50:02,698 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:02,698 INFO L89 Accepts]: Start accepts. Operand has 52 places, 45 transitions, 230 flow [2022-12-13 00:50:02,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:02,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:02,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 45 transitions, 230 flow [2022-12-13 00:50:02,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 45 transitions, 230 flow [2022-12-13 00:50:02,723 INFO L130 PetriNetUnfolder]: 132/347 cut-off events. [2022-12-13 00:50:02,724 INFO L131 PetriNetUnfolder]: For 554/635 co-relation queries the response was YES. [2022-12-13 00:50:02,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 347 events. 132/347 cut-off events. For 554/635 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2088 event pairs, 52 based on Foata normal form. 6/251 useless extension candidates. Maximal degree in co-relation 924. Up to 174 conditions per place. [2022-12-13 00:50:02,726 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 45 transitions, 230 flow [2022-12-13 00:50:02,726 INFO L226 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-13 00:50:03,057 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:03,058 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 360 [2022-12-13 00:50:03,058 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 236 flow [2022-12-13 00:50:03,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:03,059 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:03,059 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:03,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 00:50:03,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1801366658, now seen corresponding path program 1 times [2022-12-13 00:50:03,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:03,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538981779] [2022-12-13 00:50:03,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:03,229 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 00:50:03,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:03,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538981779] [2022-12-13 00:50:03,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538981779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:03,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:03,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998116681] [2022-12-13 00:50:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:03,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:03,232 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2022-12-13 00:50:03,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 236 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:03,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:03,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2022-12-13 00:50:03,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:03,506 INFO L130 PetriNetUnfolder]: 1447/2267 cut-off events. [2022-12-13 00:50:03,506 INFO L131 PetriNetUnfolder]: For 3951/3954 co-relation queries the response was YES. [2022-12-13 00:50:03,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 2267 events. 1447/2267 cut-off events. For 3951/3954 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11244 event pairs, 323 based on Foata normal form. 6/1906 useless extension candidates. Maximal degree in co-relation 7238. Up to 1864 conditions per place. [2022-12-13 00:50:03,519 INFO L137 encePairwiseOnDemand]: 30/39 looper letters, 46 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2022-12-13 00:50:03,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 432 flow [2022-12-13 00:50:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2022-12-13 00:50:03,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-13 00:50:03,521 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 236 flow. Second operand 4 states and 92 transitions. [2022-12-13 00:50:03,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 432 flow [2022-12-13 00:50:03,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:03,524 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 273 flow [2022-12-13 00:50:03,524 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2022-12-13 00:50:03,525 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -21 predicate places. [2022-12-13 00:50:03,525 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:03,525 INFO L89 Accepts]: Start accepts. Operand has 54 places, 49 transitions, 273 flow [2022-12-13 00:50:03,525 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:03,525 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:03,526 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 49 transitions, 273 flow [2022-12-13 00:50:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 49 transitions, 273 flow [2022-12-13 00:50:03,560 INFO L130 PetriNetUnfolder]: 137/347 cut-off events. [2022-12-13 00:50:03,560 INFO L131 PetriNetUnfolder]: For 698/767 co-relation queries the response was YES. [2022-12-13 00:50:03,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 347 events. 137/347 cut-off events. For 698/767 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1998 event pairs, 37 based on Foata normal form. 6/265 useless extension candidates. Maximal degree in co-relation 1019. Up to 174 conditions per place. [2022-12-13 00:50:03,563 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 49 transitions, 273 flow [2022-12-13 00:50:03,563 INFO L226 LiptonReduction]: Number of co-enabled transitions 676 [2022-12-13 00:50:03,746 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L794: Formula: (and (= v_~y~0_43 v_~__unbuffered_p2_EAX~0_95) (= v_~z~0_586 1) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_43} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z~0=v_~z~0_586, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:50:03,821 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L794: Formula: (and (= v_~y~0_43 v_~__unbuffered_p2_EAX~0_95) (= v_~z~0_586 1) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_43} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z~0=v_~z~0_586, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-13 00:50:03,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [478] $Ultimate##0-->L794: Formula: (and (= v_~y~0_43 v_~__unbuffered_p2_EAX~0_95) (= v_~z~0_586 1) (= v_P2Thread1of1ForFork1_~arg.base_15 |v_P2Thread1of1ForFork1_#in~arg.base_15|) (= v_P2Thread1of1ForFork1_~arg.offset_15 |v_P2Thread1of1ForFork1_#in~arg.offset_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~y~0=v_~y~0_43} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_15, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_15, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_95, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_15|, ~z~0=v_~z~0_586, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [410] L2-1-->L834: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_203 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_88 256) 0))) (.cse4 (not (= (mod v_~z$r_buff1_thd0~0_88 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff1_used~0_172 256) 0)) .cse4)) (.cse2 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_204 256) 0))))) (and (= v_~z~0_124 (ite .cse0 v_~z$w_buff0~0_115 (ite .cse1 v_~z$w_buff1~0_103 v_~z~0_125))) (= v_~z$r_buff0_thd0~0_87 (ite .cse2 0 v_~z$r_buff0_thd0~0_88)) (= v_~z$w_buff1_used~0_171 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_172)) (= (ite (or (and .cse3 (not (= (mod v_~z$r_buff0_thd0~0_87 256) 0))) (and (not (= (mod v_~z$w_buff1_used~0_171 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_88) v_~z$r_buff1_thd0~0_87) (= (ite .cse0 0 v_~z$w_buff0_used~0_204) v_~z$w_buff0_used~0_203)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_88, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_204, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_88, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_172, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_125} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_87, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_203, ~z$w_buff0~0=v_~z$w_buff0~0_115, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_87, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_171, ~z$w_buff1~0=v_~z$w_buff1~0_103, ~z~0=v_~z~0_124} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0] [2022-12-13 00:50:04,006 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:04,006 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 481 [2022-12-13 00:50:04,007 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 294 flow [2022-12-13 00:50:04,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:04,007 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:04,007 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:04,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 00:50:04,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:04,008 INFO L85 PathProgramCache]: Analyzing trace with hash -215034098, now seen corresponding path program 1 times [2022-12-13 00:50:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:04,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236986707] [2022-12-13 00:50:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:04,373 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 00:50:04,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:04,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236986707] [2022-12-13 00:50:04,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236986707] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:04,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:04,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922024472] [2022-12-13 00:50:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:04,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:04,375 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:50:04,375 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:04,375 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:04,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:50:04,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:04,700 INFO L130 PetriNetUnfolder]: 1397/2201 cut-off events. [2022-12-13 00:50:04,701 INFO L131 PetriNetUnfolder]: For 5478/5481 co-relation queries the response was YES. [2022-12-13 00:50:04,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 2201 events. 1397/2201 cut-off events. For 5478/5481 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 11135 event pairs, 315 based on Foata normal form. 18/1863 useless extension candidates. Maximal degree in co-relation 7552. Up to 1848 conditions per place. [2022-12-13 00:50:04,715 INFO L137 encePairwiseOnDemand]: 36/42 looper letters, 45 selfloop transitions, 6 changer transitions 0/62 dead transitions. [2022-12-13 00:50:04,715 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 450 flow [2022-12-13 00:50:04,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-13 00:50:04,716 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-13 00:50:04,716 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 294 flow. Second operand 3 states and 77 transitions. [2022-12-13 00:50:04,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 450 flow [2022-12-13 00:50:04,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 438 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:04,721 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 302 flow [2022-12-13 00:50:04,721 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-13 00:50:04,721 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2022-12-13 00:50:04,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:04,721 INFO L89 Accepts]: Start accepts. Operand has 55 places, 48 transitions, 302 flow [2022-12-13 00:50:04,722 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:04,722 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:04,722 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 48 transitions, 302 flow [2022-12-13 00:50:04,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 48 transitions, 302 flow [2022-12-13 00:50:04,749 INFO L130 PetriNetUnfolder]: 138/355 cut-off events. [2022-12-13 00:50:04,749 INFO L131 PetriNetUnfolder]: For 830/902 co-relation queries the response was YES. [2022-12-13 00:50:04,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 355 events. 138/355 cut-off events. For 830/902 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2166 event pairs, 58 based on Foata normal form. 6/271 useless extension candidates. Maximal degree in co-relation 1064. Up to 176 conditions per place. [2022-12-13 00:50:04,752 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 48 transitions, 302 flow [2022-12-13 00:50:04,753 INFO L226 LiptonReduction]: Number of co-enabled transitions 662 [2022-12-13 00:50:04,754 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [482] $Ultimate##0-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_173 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_744 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_167 256) 0)))) (let ((.cse1 (and (not (= (mod v_~z$w_buff0_used~0_745 256) 0)) .cse5)) (.cse0 (and .cse5 .cse4)) (.cse2 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_663 256) 0))))) (and (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= v_~z$r_buff0_thd2~0_166 (ite .cse0 0 v_~z$r_buff0_thd2~0_167)) (= v_~z~0_614 (ite .cse1 v_~z$w_buff0~0_525 (ite .cse2 v_~z$w_buff1~0_472 1))) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= v_~y~0_47 v_~__unbuffered_p2_EAX~0_99) (= (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_662 256) 0))) (and (not (= (mod v_~z$r_buff0_thd2~0_166 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_173) v_~z$r_buff1_thd2~0_172) (= (ite .cse1 0 v_~z$w_buff0_used~0_745) v_~z$w_buff0_used~0_744) (= (ite (or .cse0 .cse2) 0 v_~z$w_buff1_used~0_663) v_~z$w_buff1_used~0_662)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_745, ~z$w_buff0~0=v_~z$w_buff0~0_525, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_173, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_663, ~z$w_buff1~0=v_~z$w_buff1~0_472, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_47, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_167} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_744, ~z$w_buff0~0=v_~z$w_buff0~0_525, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_172, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_662, ~z$w_buff1~0=v_~z$w_buff1~0_472, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z~0=v_~z~0_614, ~y~0=v_~y~0_47, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_166} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:50:04,835 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:04,836 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115 [2022-12-13 00:50:04,836 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 301 flow [2022-12-13 00:50:04,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:04,836 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:04,836 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:04,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 00:50:04,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1926085393, now seen corresponding path program 1 times [2022-12-13 00:50:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:04,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91154222] [2022-12-13 00:50:04,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:05,039 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 00:50:05,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:05,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91154222] [2022-12-13 00:50:05,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91154222] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:05,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:05,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:05,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849500313] [2022-12-13 00:50:05,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:05,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:05,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:05,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:05,041 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2022-12-13 00:50:05,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:05,041 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:05,042 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2022-12-13 00:50:05,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:05,307 INFO L130 PetriNetUnfolder]: 1448/2247 cut-off events. [2022-12-13 00:50:05,308 INFO L131 PetriNetUnfolder]: For 6220/6221 co-relation queries the response was YES. [2022-12-13 00:50:05,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8010 conditions, 2247 events. 1448/2247 cut-off events. For 6220/6221 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11340 event pairs, 926 based on Foata normal form. 8/1883 useless extension candidates. Maximal degree in co-relation 7988. Up to 2076 conditions per place. [2022-12-13 00:50:05,317 INFO L137 encePairwiseOnDemand]: 33/42 looper letters, 40 selfloop transitions, 8 changer transitions 0/59 dead transitions. [2022-12-13 00:50:05,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 469 flow [2022-12-13 00:50:05,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 00:50:05,318 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 00:50:05,318 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 301 flow. Second operand 4 states and 84 transitions. [2022-12-13 00:50:05,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 469 flow [2022-12-13 00:50:05,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 59 transitions, 451 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 00:50:05,321 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 370 flow [2022-12-13 00:50:05,321 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=370, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2022-12-13 00:50:05,322 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -19 predicate places. [2022-12-13 00:50:05,322 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:05,322 INFO L89 Accepts]: Start accepts. Operand has 56 places, 54 transitions, 370 flow [2022-12-13 00:50:05,323 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:05,323 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:05,323 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 54 transitions, 370 flow [2022-12-13 00:50:05,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 370 flow [2022-12-13 00:50:05,350 INFO L130 PetriNetUnfolder]: 154/379 cut-off events. [2022-12-13 00:50:05,350 INFO L131 PetriNetUnfolder]: For 1014/1107 co-relation queries the response was YES. [2022-12-13 00:50:05,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1319 conditions, 379 events. 154/379 cut-off events. For 1014/1107 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2272 event pairs, 39 based on Foata normal form. 6/289 useless extension candidates. Maximal degree in co-relation 1300. Up to 198 conditions per place. [2022-12-13 00:50:05,354 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 54 transitions, 370 flow [2022-12-13 00:50:05,354 INFO L226 LiptonReduction]: Number of co-enabled transitions 706 [2022-12-13 00:50:05,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [339] L794-->L801: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_26 256) 0)))) (let ((.cse2 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_115 256) 0)))) (.cse3 (and .cse5 .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_132 256) 0)) .cse5))) (and (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_27 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_114 256) 0)))) 0 v_~z$r_buff1_thd3~0_26) v_~z$r_buff1_thd3~0_25) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_115) v_~z$w_buff1_used~0_114) (= v_~z~0_73 (ite .cse4 v_~z$w_buff0~0_55 (ite .cse2 v_~z$w_buff1~0_58 v_~z~0_74))) (= (ite .cse3 0 v_~z$r_buff0_thd3~0_28) v_~z$r_buff0_thd3~0_27) (= v_~z$w_buff0_used~0_131 (ite .cse4 0 v_~z$w_buff0_used~0_132))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_115, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_74} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_73} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] and [483] $Ultimate##0-->L751: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_90| |v_P0Thread1of1ForFork2_~arg#1.offset_90|) (= v_~z$w_buff0~0_528 v_~z$w_buff1~0_474) (= v_~z$r_buff0_thd1~0_244 1) (= v_~z$r_buff0_thd0~0_388 v_~z$r_buff1_thd0~0_397) (= v_~z$w_buff0~0_527 2) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z$r_buff0_thd2~0_170 v_~z$r_buff1_thd2~0_176) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_666 256) 0)) (not (= (mod v_~z$w_buff0_used~0_748 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|) (= v_~z$r_buff0_thd1~0_245 v_~z$r_buff1_thd1~0_178) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_90| |v_P0Thread1of1ForFork2_~arg#1.base_90|) (= v_~z$r_buff0_thd3~0_146 v_~z$r_buff1_thd3~0_152) (= v_~z~0_618 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~z$w_buff0_used~0_749 v_~z$w_buff1_used~0_666) (= v_~z$w_buff0_used~0_748 1) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_101) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92| 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_528, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_245, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_176, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|, ~z$w_buff1~0=v_~z$w_buff1~0_474, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_90|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_397, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_101, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_748, ~z$w_buff0~0=v_~z$w_buff0~0_527, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_152, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_666, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_90|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_178, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_618, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_244} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p2_EAX~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:50:05,545 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] and [483] $Ultimate##0-->L751: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_90| |v_P0Thread1of1ForFork2_~arg#1.offset_90|) (= v_~z$w_buff0~0_528 v_~z$w_buff1~0_474) (= v_~z$r_buff0_thd1~0_244 1) (= v_~z$r_buff0_thd0~0_388 v_~z$r_buff1_thd0~0_397) (= v_~z$w_buff0~0_527 2) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z$r_buff0_thd2~0_170 v_~z$r_buff1_thd2~0_176) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_666 256) 0)) (not (= (mod v_~z$w_buff0_used~0_748 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|) (= v_~z$r_buff0_thd1~0_245 v_~z$r_buff1_thd1~0_178) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_90| |v_P0Thread1of1ForFork2_~arg#1.base_90|) (= v_~z$r_buff0_thd3~0_146 v_~z$r_buff1_thd3~0_152) (= v_~z~0_618 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~z$w_buff0_used~0_749 v_~z$w_buff1_used~0_666) (= v_~z$w_buff0_used~0_748 1) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_101) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92| 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_528, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_245, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_176, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|, ~z$w_buff1~0=v_~z$w_buff1~0_474, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_90|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_397, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_101, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_748, ~z$w_buff0~0=v_~z$w_buff0~0_527, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_152, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_666, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_90|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_178, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_618, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_244} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p2_EAX~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:50:05,712 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L754-->L761: Formula: (let ((.cse3 (not (= (mod v_~z$w_buff0_used~0_143 256) 0))) (.cse2 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_31 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_144 256) 0)))) (.cse1 (and .cse2 (not (= 0 (mod v_~z$w_buff1_used~0_127 256))))) (.cse4 (and .cse3 .cse5))) (and (= v_~z$w_buff0_used~0_143 (ite .cse0 0 v_~z$w_buff0_used~0_144)) (= v_~z~0_85 (ite .cse0 v_~z$w_buff0~0_65 (ite .cse1 v_~z$w_buff1~0_68 v_~z~0_86))) (= v_~z$r_buff1_thd1~0_19 (ite (or (and .cse2 (not (= (mod v_~z$w_buff1_used~0_126 256) 0))) (and (not (= (mod v_~z$r_buff0_thd1~0_30 256) 0)) .cse3)) 0 v_~z$r_buff1_thd1~0_20)) (= v_~z$r_buff0_thd1~0_30 (ite .cse4 0 v_~z$r_buff0_thd1~0_31)) (= v_~z$w_buff1_used~0_126 (ite (or .cse1 .cse4) 0 v_~z$w_buff1_used~0_127))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_144, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_127, ~z$w_buff1~0=v_~z$w_buff1~0_68, ~z~0=v_~z~0_86, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_31} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_65, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_126, ~z$w_buff1~0=v_~z$w_buff1~0_68, ~z~0=v_~z~0_85, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0] and [483] $Ultimate##0-->L751: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_90| |v_P0Thread1of1ForFork2_~arg#1.offset_90|) (= v_~z$w_buff0~0_528 v_~z$w_buff1~0_474) (= v_~z$r_buff0_thd1~0_244 1) (= v_~z$r_buff0_thd0~0_388 v_~z$r_buff1_thd0~0_397) (= v_~z$w_buff0~0_527 2) (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z$r_buff0_thd2~0_170 v_~z$r_buff1_thd2~0_176) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|) (= (ite (not (and (not (= (mod v_~z$w_buff1_used~0_666 256) 0)) (not (= (mod v_~z$w_buff0_used~0_748 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|) (= v_~z$r_buff0_thd1~0_245 v_~z$r_buff1_thd1~0_178) (= |v_P0Thread1of1ForFork2_#in~arg#1.base_90| |v_P0Thread1of1ForFork2_~arg#1.base_90|) (= v_~z$r_buff0_thd3~0_146 v_~z$r_buff1_thd3~0_152) (= v_~z~0_618 1) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= v_~z$w_buff0_used~0_749 v_~z$w_buff1_used~0_666) (= v_~z$w_buff0_used~0_748 1) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_101) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92| 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_528, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_245, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_176, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_92|, ~z$w_buff1~0=v_~z$w_buff1~0_474, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_90|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_90|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_388, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_92|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_397, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_101, ~y~0=v_~y~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_170, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_748, ~z$w_buff0~0=v_~z$w_buff0~0_527, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_90|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_152, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_666, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_90|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_178, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_146, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_618, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_244} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~__unbuffered_p2_EAX~0, ~z~0, ~z$r_buff0_thd1~0] [2022-12-13 00:50:05,892 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:05,893 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 571 [2022-12-13 00:50:05,893 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 411 flow [2022-12-13 00:50:05,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:05,893 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:05,893 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:05,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 00:50:05,893 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1923875403, now seen corresponding path program 1 times [2022-12-13 00:50:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:05,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712832776] [2022-12-13 00:50:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:06,121 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 00:50:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:06,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712832776] [2022-12-13 00:50:06,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712832776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:06,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:06,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360562438] [2022-12-13 00:50:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:06,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:06,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:06,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:06,123 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 45 [2022-12-13 00:50:06,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 411 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:06,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:06,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 45 [2022-12-13 00:50:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:06,536 INFO L130 PetriNetUnfolder]: 2090/3282 cut-off events. [2022-12-13 00:50:06,536 INFO L131 PetriNetUnfolder]: For 11000/11003 co-relation queries the response was YES. [2022-12-13 00:50:06,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12346 conditions, 3282 events. 2090/3282 cut-off events. For 11000/11003 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 18279 event pairs, 361 based on Foata normal form. 6/2706 useless extension candidates. Maximal degree in co-relation 12324. Up to 2821 conditions per place. [2022-12-13 00:50:06,552 INFO L137 encePairwiseOnDemand]: 33/45 looper letters, 51 selfloop transitions, 19 changer transitions 0/81 dead transitions. [2022-12-13 00:50:06,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 651 flow [2022-12-13 00:50:06,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:50:06,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:50:06,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 00:50:06,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2022-12-13 00:50:06,554 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 411 flow. Second operand 5 states and 112 transitions. [2022-12-13 00:50:06,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 651 flow [2022-12-13 00:50:06,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 644 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:06,560 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 489 flow [2022-12-13 00:50:06,561 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=45, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=489, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2022-12-13 00:50:06,561 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -14 predicate places. [2022-12-13 00:50:06,561 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:06,561 INFO L89 Accepts]: Start accepts. Operand has 61 places, 60 transitions, 489 flow [2022-12-13 00:50:06,561 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:06,562 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:06,562 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 60 transitions, 489 flow [2022-12-13 00:50:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 60 transitions, 489 flow [2022-12-13 00:50:06,600 INFO L130 PetriNetUnfolder]: 183/473 cut-off events. [2022-12-13 00:50:06,600 INFO L131 PetriNetUnfolder]: For 1830/1944 co-relation queries the response was YES. [2022-12-13 00:50:06,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1921 conditions, 473 events. 183/473 cut-off events. For 1830/1944 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3129 event pairs, 56 based on Foata normal form. 6/359 useless extension candidates. Maximal degree in co-relation 1900. Up to 255 conditions per place. [2022-12-13 00:50:06,604 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 60 transitions, 489 flow [2022-12-13 00:50:06,604 INFO L226 LiptonReduction]: Number of co-enabled transitions 730 [2022-12-13 00:50:06,671 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L834: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd0~0_391 256) 0))) (.cse4 (not (= 0 (mod v_~z$w_buff0_used~0_752 256)))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_400 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_669 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_753 256) 0))))) (and (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_103) (= v_~z~0_620 (ite .cse0 v_~z$w_buff0~0_531 (ite .cse1 v_~z$w_buff1~0_476 1))) (= v_~z$r_buff0_thd0~0_390 (ite .cse2 0 v_~z$r_buff0_thd0~0_391)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_669) v_~z$w_buff1_used~0_668) (= v_~z$w_buff0_used~0_752 (ite .cse0 0 v_~z$w_buff0_used~0_753)) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z$r_buff1_thd0~0_399 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_668 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_390 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_400)) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_391, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_753, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_400, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_669, ~z$w_buff1~0=v_~z$w_buff1~0_476, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_51} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_752, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_668, ~z$w_buff1~0=v_~z$w_buff1~0_476, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_390, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_620, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~z~0] and [339] L794-->L801: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd3~0_28 256) 0))) (.cse0 (not (= (mod v_~z$w_buff0_used~0_131 256) 0))) (.cse1 (not (= (mod v_~z$r_buff1_thd3~0_26 256) 0)))) (let ((.cse2 (and .cse1 (not (= (mod v_~z$w_buff1_used~0_115 256) 0)))) (.cse3 (and .cse5 .cse0)) (.cse4 (and (not (= (mod v_~z$w_buff0_used~0_132 256) 0)) .cse5))) (and (= (ite (or (and (not (= (mod v_~z$r_buff0_thd3~0_27 256) 0)) .cse0) (and .cse1 (not (= (mod v_~z$w_buff1_used~0_114 256) 0)))) 0 v_~z$r_buff1_thd3~0_26) v_~z$r_buff1_thd3~0_25) (= (ite (or .cse2 .cse3) 0 v_~z$w_buff1_used~0_115) v_~z$w_buff1_used~0_114) (= v_~z~0_73 (ite .cse4 v_~z$w_buff0~0_55 (ite .cse2 v_~z$w_buff1~0_58 v_~z~0_74))) (= (ite .cse3 0 v_~z$r_buff0_thd3~0_28) v_~z$r_buff0_thd3~0_27) (= v_~z$w_buff0_used~0_131 (ite .cse4 0 v_~z$w_buff0_used~0_132))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_132, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_115, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_28, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_74} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_131, ~z$w_buff0~0=v_~z$w_buff0~0_55, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_27, ~z$w_buff1~0=v_~z$w_buff1~0_58, ~z~0=v_~z~0_73} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd3~0, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, ~z~0] [2022-12-13 00:50:06,867 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L834: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd0~0_391 256) 0))) (.cse4 (not (= 0 (mod v_~z$w_buff0_used~0_752 256)))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_400 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_669 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_753 256) 0))))) (and (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_103) (= v_~z~0_620 (ite .cse0 v_~z$w_buff0~0_531 (ite .cse1 v_~z$w_buff1~0_476 1))) (= v_~z$r_buff0_thd0~0_390 (ite .cse2 0 v_~z$r_buff0_thd0~0_391)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_669) v_~z$w_buff1_used~0_668) (= v_~z$w_buff0_used~0_752 (ite .cse0 0 v_~z$w_buff0_used~0_753)) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z$r_buff1_thd0~0_399 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_668 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_390 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_400)) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_391, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_753, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_400, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_669, ~z$w_buff1~0=v_~z$w_buff1~0_476, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_51} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_752, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_668, ~z$w_buff1~0=v_~z$w_buff1~0_476, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_390, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_620, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~z~0] and [332] L774-->L781: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd2~0_24 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd2~0_26 256) 0))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_109 256) 0)))) (let ((.cse2 (and .cse5 .cse4)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_91 256) 0)) .cse3)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_110 256) 0))))) (and (= v_~z~0_57 (ite .cse0 v_~z$w_buff0~0_45 (ite .cse1 v_~z$w_buff1~0_48 v_~z~0_58))) (= v_~z$r_buff0_thd2~0_25 (ite .cse2 0 v_~z$r_buff0_thd2~0_26)) (= (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_91) v_~z$w_buff1_used~0_90) (= (ite .cse0 0 v_~z$w_buff0_used~0_110) v_~z$w_buff0_used~0_109) (= v_~z$r_buff1_thd2~0_23 (ite (or (and (not (= (mod v_~z$w_buff1_used~0_90 256) 0)) .cse3) (and (not (= (mod v_~z$r_buff0_thd2~0_25 256) 0)) .cse4)) 0 v_~z$r_buff1_thd2~0_24))))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_110, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_24, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_91, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_58, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_26} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_109, ~z$w_buff0~0=v_~z$w_buff0~0_45, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_23, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_90, ~z$w_buff1~0=v_~z$w_buff1~0_48, ~z~0=v_~z~0_57, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:50:07,010 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] $Ultimate##0-->L834: Formula: (let ((.cse5 (not (= (mod v_~z$r_buff0_thd0~0_391 256) 0))) (.cse4 (not (= 0 (mod v_~z$w_buff0_used~0_752 256)))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_400 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_669 256) 0)))) (.cse2 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_753 256) 0))))) (and (= v_~y~0_51 v_~__unbuffered_p2_EAX~0_103) (= v_~z~0_620 (ite .cse0 v_~z$w_buff0~0_531 (ite .cse1 v_~z$w_buff1~0_476 1))) (= v_~z$r_buff0_thd0~0_390 (ite .cse2 0 v_~z$r_buff0_thd0~0_391)) (= (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_669) v_~z$w_buff1_used~0_668) (= v_~z$w_buff0_used~0_752 (ite .cse0 0 v_~z$w_buff0_used~0_753)) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z$r_buff1_thd0~0_399 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_668 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_390 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_400)) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|)))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_391, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_753, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_400, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_669, ~z$w_buff1~0=v_~z$w_buff1~0_476, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~y~0=v_~y~0_51} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_752, ~z$w_buff0~0=v_~z$w_buff0~0_531, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_668, ~z$w_buff1~0=v_~z$w_buff1~0_476, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_390, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_399, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_103, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_620, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~z~0] and [369] $Ultimate##0-->L751: Formula: (and (= v_~z$w_buff0~0_102 v_~z$w_buff1~0_94) (= v_~z$w_buff0~0_101 2) (= |v_P0Thread1of1ForFork2_~arg#1.offset_7| |v_P0Thread1of1ForFork2_#in~arg#1.offset_7|) (= v_~z$w_buff0_used~0_185 1) (= v_~z$r_buff0_thd1~0_48 1) (= v_~z$r_buff0_thd3~0_35 v_~z$r_buff1_thd3~0_37) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|) (= |v_P0Thread1of1ForFork2_~arg#1.base_7| |v_P0Thread1of1ForFork2_#in~arg#1.base_7|) (= v_~z$r_buff0_thd0~0_81 v_~z$r_buff1_thd0~0_81) (= v_~z$r_buff0_thd2~0_37 v_~z$r_buff1_thd2~0_39) (= v_~z$r_buff0_thd1~0_49 v_~z$r_buff1_thd1~0_33) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9| 0)) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_185 256) 0)) (not (= (mod v_~z$w_buff1_used~0_158 256) 0)))) 1 0) |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|) (= v_~z$w_buff0_used~0_186 v_~z$w_buff1_used~0_158)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_186, ~z$w_buff0~0=v_~z$w_buff0~0_102, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_49, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_185, ~z$w_buff0~0=v_~z$w_buff0~0_101, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_39, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_158, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_9|, ~z$w_buff1~0=v_~z$w_buff1~0_94, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_7|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_7|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_81, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_81, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_33, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_37} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] [2022-12-13 00:50:07,190 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [331] L771-->L774: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [490] $Ultimate##0-->L781: Formula: (let ((.cse14 (not (= (mod v_~z$r_buff0_thd0~0_405 256) 0)))) (let ((.cse11 (and .cse14 (not (= (mod v_~z$w_buff0_used~0_786 256) 0))))) (let ((.cse1 (ite .cse11 0 v_~z$w_buff0_used~0_786))) (let ((.cse8 (not (= (mod v_~z$r_buff1_thd0~0_414 256) 0))) (.cse9 (not (= (mod .cse1 256) 0)))) (let ((.cse10 (and .cse14 .cse9)) (.cse12 (and (not (= (mod v_~z$w_buff1_used~0_702 256) 0)) .cse8))) (let ((.cse4 (ite (or .cse10 .cse12) 0 v_~z$w_buff1_used~0_702))) (let ((.cse5 (not (= (mod v_~z$r_buff1_thd2~0_193 256) 0))) (.cse7 (not (= 0 (mod .cse4 256)))) (.cse13 (not (= (mod v_~z$r_buff0_thd2~0_185 256) 0))) (.cse6 (not (= (mod v_~z$w_buff0_used~0_784 256) 0)))) (let ((.cse3 (and .cse13 .cse6)) (.cse0 (and .cse13 .cse9)) (.cse2 (and .cse5 .cse7))) (and (= (ite .cse0 0 .cse1) v_~z$w_buff0_used~0_784) (= v_~y~0_63 v_~__unbuffered_p2_EAX~0_115) (= v_~z$w_buff1_used~0_700 (ite (or .cse2 .cse3) 0 .cse4)) (= (ite (or (and .cse5 (not (= (mod v_~z$w_buff1_used~0_700 256) 0))) (and .cse6 (not (= (mod v_~z$r_buff0_thd2~0_184 256) 0)))) 0 v_~z$r_buff1_thd2~0_193) v_~z$r_buff1_thd2~0_192) (= v_~z$r_buff0_thd2~0_184 (ite .cse3 0 v_~z$r_buff0_thd2~0_185)) (= v_~z$r_buff1_thd0~0_413 (ite (or (and .cse7 .cse8) (and (not (= (mod v_~z$r_buff0_thd0~0_404 256) 0)) .cse9)) 0 v_~z$r_buff1_thd0~0_414)) (= v_~z$r_buff0_thd0~0_404 (ite .cse10 0 v_~z$r_buff0_thd0~0_405)) (= v_P2Thread1of1ForFork1_~arg.base_35 |v_P2Thread1of1ForFork1_#in~arg.base_35|) (= v_P2Thread1of1ForFork1_~arg.offset_35 |v_P2Thread1of1ForFork1_#in~arg.offset_35|) (= v_~z~0_648 (ite .cse0 v_~z$w_buff0~0_549 (ite .cse2 v_~z$w_buff1~0_494 (ite .cse11 v_~z$w_buff0~0_549 (ite .cse12 v_~z$w_buff1~0_494 1)))))))))))))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_35|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_405, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_786, ~z$w_buff0~0=v_~z$w_buff0~0_549, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_414, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_193, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_702, ~z$w_buff1~0=v_~z$w_buff1~0_494, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_35|, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_185} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_35|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_784, ~z$w_buff0~0=v_~z$w_buff0~0_549, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_192, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_700, ~z$w_buff1~0=v_~z$w_buff1~0_494, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_404, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_35, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_413, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_35|, ~z~0=v_~z~0_648, ~y~0=v_~y~0_63, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, P2Thread1of1ForFork1_~arg.offset, ~z$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, ~__unbuffered_p2_EAX~0, ~z~0, ~z$r_buff0_thd2~0] [2022-12-13 00:50:07,352 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:50:07,352 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 791 [2022-12-13 00:50:07,352 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 59 transitions, 504 flow [2022-12-13 00:50:07,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:07,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:07,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:07,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 00:50:07,353 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1928392103, now seen corresponding path program 1 times [2022-12-13 00:50:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:07,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507990789] [2022-12-13 00:50:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:07,762 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 00:50:07,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:07,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507990789] [2022-12-13 00:50:07,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507990789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:07,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:07,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:07,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36252231] [2022-12-13 00:50:07,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:07,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:07,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:07,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:07,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:07,764 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:50:07,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 59 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 00:50:07,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:07,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:50:07,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:08,266 INFO L130 PetriNetUnfolder]: 2247/3504 cut-off events. [2022-12-13 00:50:08,266 INFO L131 PetriNetUnfolder]: For 18275/18308 co-relation queries the response was YES. [2022-12-13 00:50:08,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14690 conditions, 3504 events. 2247/3504 cut-off events. For 18275/18308 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 19689 event pairs, 346 based on Foata normal form. 44/2933 useless extension candidates. Maximal degree in co-relation 14666. Up to 2710 conditions per place. [2022-12-13 00:50:08,289 INFO L137 encePairwiseOnDemand]: 31/44 looper letters, 57 selfloop transitions, 24 changer transitions 0/92 dead transitions. [2022-12-13 00:50:08,289 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 858 flow [2022-12-13 00:50:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:08,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-12-13 00:50:08,290 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6193181818181818 [2022-12-13 00:50:08,290 INFO L175 Difference]: Start difference. First operand has 60 places, 59 transitions, 504 flow. Second operand 4 states and 109 transitions. [2022-12-13 00:50:08,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 858 flow [2022-12-13 00:50:08,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 814 flow, removed 15 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:08,300 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,300 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=623, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2022-12-13 00:50:08,300 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2022-12-13 00:50:08,300 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:08,301 INFO L89 Accepts]: Start accepts. Operand has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,301 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:08,301 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:08,301 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,339 INFO L130 PetriNetUnfolder]: 193/505 cut-off events. [2022-12-13 00:50:08,340 INFO L131 PetriNetUnfolder]: For 2197/2356 co-relation queries the response was YES. [2022-12-13 00:50:08,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2214 conditions, 505 events. 193/505 cut-off events. For 2197/2356 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3432 event pairs, 43 based on Foata normal form. 13/391 useless extension candidates. Maximal degree in co-relation 2192. Up to 272 conditions per place. [2022-12-13 00:50:08,344 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,344 INFO L226 LiptonReduction]: Number of co-enabled transitions 790 [2022-12-13 00:50:08,346 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:08,346 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 46 [2022-12-13 00:50:08,346 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 623 flow [2022-12-13 00:50:08,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 00:50:08,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:08,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 00:50:08,347 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:08,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1923885354, now seen corresponding path program 1 times [2022-12-13 00:50:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:08,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681334871] [2022-12-13 00:50:08,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:08,670 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 00:50:08,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:08,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681334871] [2022-12-13 00:50:08,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681334871] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:08,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:08,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:08,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837286367] [2022-12-13 00:50:08,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:08,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:08,671 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2022-12-13 00:50:08,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 623 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:08,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:08,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2022-12-13 00:50:08,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:09,171 INFO L130 PetriNetUnfolder]: 3247/5135 cut-off events. [2022-12-13 00:50:09,171 INFO L131 PetriNetUnfolder]: For 31648/31648 co-relation queries the response was YES. [2022-12-13 00:50:09,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20926 conditions, 5135 events. 3247/5135 cut-off events. For 31648/31648 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 31090 event pairs, 1059 based on Foata normal form. 141/4253 useless extension candidates. Maximal degree in co-relation 20901. Up to 3392 conditions per place. [2022-12-13 00:50:09,201 INFO L137 encePairwiseOnDemand]: 28/44 looper letters, 51 selfloop transitions, 32 changer transitions 0/92 dead transitions. [2022-12-13 00:50:09,201 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 967 flow [2022-12-13 00:50:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:09,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 00:50:09,203 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 00:50:09,203 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 623 flow. Second operand 3 states and 82 transitions. [2022-12-13 00:50:09,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 967 flow [2022-12-13 00:50:09,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 909 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 00:50:09,213 INFO L231 Difference]: Finished difference. Result has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,213 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=62, PETRI_TRANSITIONS=79} [2022-12-13 00:50:09,214 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -13 predicate places. [2022-12-13 00:50:09,214 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:09,214 INFO L89 Accepts]: Start accepts. Operand has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,215 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:09,215 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:09,215 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,272 INFO L130 PetriNetUnfolder]: 261/719 cut-off events. [2022-12-13 00:50:09,272 INFO L131 PetriNetUnfolder]: For 3047/3160 co-relation queries the response was YES. [2022-12-13 00:50:09,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 719 events. 261/719 cut-off events. For 3047/3160 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 5443 event pairs, 38 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 3137. Up to 368 conditions per place. [2022-12-13 00:50:09,279 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,279 INFO L226 LiptonReduction]: Number of co-enabled transitions 960 [2022-12-13 00:50:09,281 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:09,281 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-13 00:50:09,281 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 79 transitions, 833 flow [2022-12-13 00:50:09,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:09,281 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:09,281 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:09,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 00:50:09,282 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:09,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:09,282 INFO L85 PathProgramCache]: Analyzing trace with hash -509287661, now seen corresponding path program 1 times [2022-12-13 00:50:09,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:09,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187386710] [2022-12-13 00:50:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:09,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:09,631 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 00:50:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:09,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187386710] [2022-12-13 00:50:09,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187386710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:09,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:09,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196258192] [2022-12-13 00:50:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:09,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:09,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:09,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:09,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:09,633 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:50:09,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 79 transitions, 833 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:09,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:09,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:50:09,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:10,148 INFO L130 PetriNetUnfolder]: 3263/5277 cut-off events. [2022-12-13 00:50:10,149 INFO L131 PetriNetUnfolder]: For 27993/28015 co-relation queries the response was YES. [2022-12-13 00:50:10,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22667 conditions, 5277 events. 3263/5277 cut-off events. For 27993/28015 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 34270 event pairs, 649 based on Foata normal form. 43/4281 useless extension candidates. Maximal degree in co-relation 22642. Up to 3881 conditions per place. [2022-12-13 00:50:10,180 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 74 selfloop transitions, 29 changer transitions 0/114 dead transitions. [2022-12-13 00:50:10,181 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 114 transitions, 1261 flow [2022-12-13 00:50:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 00:50:10,182 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 00:50:10,182 INFO L175 Difference]: Start difference. First operand has 62 places, 79 transitions, 833 flow. Second operand 4 states and 108 transitions. [2022-12-13 00:50:10,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 114 transitions, 1261 flow [2022-12-13 00:50:10,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 114 transitions, 1173 flow, removed 25 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:10,204 INFO L231 Difference]: Finished difference. Result has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,204 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=65, PETRI_TRANSITIONS=84} [2022-12-13 00:50:10,205 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -10 predicate places. [2022-12-13 00:50:10,205 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:10,205 INFO L89 Accepts]: Start accepts. Operand has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,205 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:10,205 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:10,205 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,259 INFO L130 PetriNetUnfolder]: 251/704 cut-off events. [2022-12-13 00:50:10,259 INFO L131 PetriNetUnfolder]: For 3418/3480 co-relation queries the response was YES. [2022-12-13 00:50:10,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3124 conditions, 704 events. 251/704 cut-off events. For 3418/3480 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 5345 event pairs, 42 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 3100. Up to 305 conditions per place. [2022-12-13 00:50:10,265 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,265 INFO L226 LiptonReduction]: Number of co-enabled transitions 1028 [2022-12-13 00:50:10,267 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:10,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 64 [2022-12-13 00:50:10,269 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 84 transitions, 920 flow [2022-12-13 00:50:10,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:10,270 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:10,270 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:10,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 00:50:10,270 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2034776230, now seen corresponding path program 1 times [2022-12-13 00:50:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:10,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680138522] [2022-12-13 00:50:10,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:10,677 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 00:50:10,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:10,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680138522] [2022-12-13 00:50:10,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680138522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:10,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:10,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412467257] [2022-12-13 00:50:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:10,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:10,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:10,679 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:50:10,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 84 transitions, 920 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:10,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:10,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:50:10,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:11,240 INFO L130 PetriNetUnfolder]: 3477/5626 cut-off events. [2022-12-13 00:50:11,241 INFO L131 PetriNetUnfolder]: For 33576/33601 co-relation queries the response was YES. [2022-12-13 00:50:11,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23913 conditions, 5626 events. 3477/5626 cut-off events. For 33576/33601 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 37079 event pairs, 509 based on Foata normal form. 58/4577 useless extension candidates. Maximal degree in co-relation 23886. Up to 4130 conditions per place. [2022-12-13 00:50:11,275 INFO L137 encePairwiseOnDemand]: 33/44 looper letters, 79 selfloop transitions, 29 changer transitions 0/119 dead transitions. [2022-12-13 00:50:11,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 1352 flow [2022-12-13 00:50:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:11,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-12-13 00:50:11,276 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-13 00:50:11,276 INFO L175 Difference]: Start difference. First operand has 65 places, 84 transitions, 920 flow. Second operand 4 states and 108 transitions. [2022-12-13 00:50:11,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 1352 flow [2022-12-13 00:50:11,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 119 transitions, 1321 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:11,292 INFO L231 Difference]: Finished difference. Result has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,292 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1053, PETRI_PLACES=67, PETRI_TRANSITIONS=89} [2022-12-13 00:50:11,293 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -8 predicate places. [2022-12-13 00:50:11,293 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:11,293 INFO L89 Accepts]: Start accepts. Operand has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,294 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:11,294 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:11,295 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,357 INFO L130 PetriNetUnfolder]: 248/719 cut-off events. [2022-12-13 00:50:11,357 INFO L131 PetriNetUnfolder]: For 3849/3877 co-relation queries the response was YES. [2022-12-13 00:50:11,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 719 events. 248/719 cut-off events. For 3849/3877 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 5667 event pairs, 36 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 3267. Up to 303 conditions per place. [2022-12-13 00:50:11,364 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,364 INFO L226 LiptonReduction]: Number of co-enabled transitions 1096 [2022-12-13 00:50:11,366 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:11,367 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-13 00:50:11,367 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 89 transitions, 1053 flow [2022-12-13 00:50:11,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 00:50:11,367 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:11,367 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:11,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 00:50:11,368 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:11,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash 150832747, now seen corresponding path program 1 times [2022-12-13 00:50:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:11,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350707648] [2022-12-13 00:50:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:11,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:11,451 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 00:50:11,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:11,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350707648] [2022-12-13 00:50:11,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350707648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:11,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:11,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819692353] [2022-12-13 00:50:11,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:11,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:11,453 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 44 [2022-12-13 00:50:11,453 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 89 transitions, 1053 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:50:11,453 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:11,453 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 44 [2022-12-13 00:50:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:11,972 INFO L130 PetriNetUnfolder]: 3851/6287 cut-off events. [2022-12-13 00:50:11,972 INFO L131 PetriNetUnfolder]: For 50096/50325 co-relation queries the response was YES. [2022-12-13 00:50:11,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27572 conditions, 6287 events. 3851/6287 cut-off events. For 50096/50325 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 41933 event pairs, 1159 based on Foata normal form. 127/5074 useless extension candidates. Maximal degree in co-relation 27544. Up to 3712 conditions per place. [2022-12-13 00:50:11,996 INFO L137 encePairwiseOnDemand]: 35/44 looper letters, 53 selfloop transitions, 4 changer transitions 47/115 dead transitions. [2022-12-13 00:50:11,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 115 transitions, 1495 flow [2022-12-13 00:50:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-13 00:50:11,997 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2022-12-13 00:50:11,997 INFO L175 Difference]: Start difference. First operand has 67 places, 89 transitions, 1053 flow. Second operand 3 states and 82 transitions. [2022-12-13 00:50:11,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 115 transitions, 1495 flow [2022-12-13 00:50:12,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 115 transitions, 1457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 00:50:12,014 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 502 flow [2022-12-13 00:50:12,014 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2022-12-13 00:50:12,014 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2022-12-13 00:50:12,014 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:12,014 INFO L89 Accepts]: Start accepts. Operand has 68 places, 54 transitions, 502 flow [2022-12-13 00:50:12,015 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:12,015 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:12,015 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 54 transitions, 502 flow [2022-12-13 00:50:12,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 54 transitions, 502 flow [2022-12-13 00:50:12,039 INFO L130 PetriNetUnfolder]: 87/318 cut-off events. [2022-12-13 00:50:12,039 INFO L131 PetriNetUnfolder]: For 1841/1855 co-relation queries the response was YES. [2022-12-13 00:50:12,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 318 events. 87/318 cut-off events. For 1841/1855 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2070 event pairs, 48 based on Foata normal form. 1/238 useless extension candidates. Maximal degree in co-relation 1358. Up to 156 conditions per place. [2022-12-13 00:50:12,041 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 54 transitions, 502 flow [2022-12-13 00:50:12,042 INFO L226 LiptonReduction]: Number of co-enabled transitions 666 [2022-12-13 00:50:12,099 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:12,100 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-13 00:50:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 507 flow [2022-12-13 00:50:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 00:50:12,100 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:12,100 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:12,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 00:50:12,100 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 151493636, now seen corresponding path program 1 times [2022-12-13 00:50:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404243000] [2022-12-13 00:50:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:12,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:12,551 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 00:50:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404243000] [2022-12-13 00:50:12,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404243000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:12,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:12,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104419044] [2022-12-13 00:50:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 00:50:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 00:50:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 00:50:12,554 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2022-12-13 00:50:12,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 00:50:12,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:12,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2022-12-13 00:50:12,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:12,835 INFO L130 PetriNetUnfolder]: 1513/2615 cut-off events. [2022-12-13 00:50:12,835 INFO L131 PetriNetUnfolder]: For 16589/16591 co-relation queries the response was YES. [2022-12-13 00:50:12,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10125 conditions, 2615 events. 1513/2615 cut-off events. For 16589/16591 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15324 event pairs, 635 based on Foata normal form. 27/2051 useless extension candidates. Maximal degree in co-relation 10097. Up to 1611 conditions per place. [2022-12-13 00:50:12,846 INFO L137 encePairwiseOnDemand]: 28/36 looper letters, 46 selfloop transitions, 9 changer transitions 16/80 dead transitions. [2022-12-13 00:50:12,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 80 transitions, 768 flow [2022-12-13 00:50:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:12,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2022-12-13 00:50:12,847 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2022-12-13 00:50:12,847 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 507 flow. Second operand 4 states and 93 transitions. [2022-12-13 00:50:12,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 80 transitions, 768 flow [2022-12-13 00:50:12,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 80 transitions, 718 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 00:50:12,861 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 369 flow [2022-12-13 00:50:12,861 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=369, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2022-12-13 00:50:12,862 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2022-12-13 00:50:12,862 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:12,862 INFO L89 Accepts]: Start accepts. Operand has 68 places, 45 transitions, 369 flow [2022-12-13 00:50:12,864 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:12,864 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:12,864 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 45 transitions, 369 flow [2022-12-13 00:50:12,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 45 transitions, 369 flow [2022-12-13 00:50:12,876 INFO L130 PetriNetUnfolder]: 51/154 cut-off events. [2022-12-13 00:50:12,876 INFO L131 PetriNetUnfolder]: For 943/953 co-relation queries the response was YES. [2022-12-13 00:50:12,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 154 events. 51/154 cut-off events. For 943/953 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 675 event pairs, 22 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 669. Up to 86 conditions per place. [2022-12-13 00:50:12,878 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 45 transitions, 369 flow [2022-12-13 00:50:12,878 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 00:50:12,878 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 00:50:12,879 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-13 00:50:12,879 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 369 flow [2022-12-13 00:50:12,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 00:50:12,879 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:12,879 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:12,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 00:50:12,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1117638038, now seen corresponding path program 1 times [2022-12-13 00:50:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556668744] [2022-12-13 00:50:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:12,958 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 00:50:12,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:12,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556668744] [2022-12-13 00:50:12,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556668744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:12,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 00:50:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931440542] [2022-12-13 00:50:12,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:12,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 00:50:12,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 00:50:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 00:50:12,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2022-12-13 00:50:12,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 369 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 00:50:12,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:12,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2022-12-13 00:50:12,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:13,120 INFO L130 PetriNetUnfolder]: 1279/1976 cut-off events. [2022-12-13 00:50:13,121 INFO L131 PetriNetUnfolder]: For 15459/15501 co-relation queries the response was YES. [2022-12-13 00:50:13,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8542 conditions, 1976 events. 1279/1976 cut-off events. For 15459/15501 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9406 event pairs, 428 based on Foata normal form. 19/1297 useless extension candidates. Maximal degree in co-relation 8515. Up to 1864 conditions per place. [2022-12-13 00:50:13,130 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 47 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2022-12-13 00:50:13,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 609 flow [2022-12-13 00:50:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 00:50:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 00:50:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-13 00:50:13,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6770833333333334 [2022-12-13 00:50:13,132 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 369 flow. Second operand 3 states and 65 transitions. [2022-12-13 00:50:13,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 609 flow [2022-12-13 00:50:13,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 487 flow, removed 43 selfloop flow, removed 11 redundant places. [2022-12-13 00:50:13,137 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 327 flow [2022-12-13 00:50:13,137 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 00:50:13,137 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -19 predicate places. [2022-12-13 00:50:13,137 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:13,137 INFO L89 Accepts]: Start accepts. Operand has 56 places, 52 transitions, 327 flow [2022-12-13 00:50:13,138 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:13,138 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:13,138 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 52 transitions, 327 flow [2022-12-13 00:50:13,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 52 transitions, 327 flow [2022-12-13 00:50:13,191 INFO L130 PetriNetUnfolder]: 530/990 cut-off events. [2022-12-13 00:50:13,191 INFO L131 PetriNetUnfolder]: For 1644/1662 co-relation queries the response was YES. [2022-12-13 00:50:13,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 990 events. 530/990 cut-off events. For 1644/1662 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 6309 event pairs, 328 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 2791. Up to 637 conditions per place. [2022-12-13 00:50:13,198 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 52 transitions, 327 flow [2022-12-13 00:50:13,198 INFO L226 LiptonReduction]: Number of co-enabled transitions 530 [2022-12-13 00:50:13,473 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 00:50:13,474 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 337 [2022-12-13 00:50:13,474 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 331 flow [2022-12-13 00:50:13,474 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 00:50:13,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:13,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:13,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 00:50:13,474 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 23376770, now seen corresponding path program 1 times [2022-12-13 00:50:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:13,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214288028] [2022-12-13 00:50:13,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:13,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:13,545 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 00:50:13,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:13,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214288028] [2022-12-13 00:50:13,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214288028] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:13,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:13,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 00:50:13,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506153291] [2022-12-13 00:50:13,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:13,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 00:50:13,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:13,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 00:50:13,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 00:50:13,547 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2022-12-13 00:50:13,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 331 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:13,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:13,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2022-12-13 00:50:13,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:13,674 INFO L130 PetriNetUnfolder]: 718/1274 cut-off events. [2022-12-13 00:50:13,675 INFO L131 PetriNetUnfolder]: For 4387/4411 co-relation queries the response was YES. [2022-12-13 00:50:13,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5297 conditions, 1274 events. 718/1274 cut-off events. For 4387/4411 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6486 event pairs, 116 based on Foata normal form. 58/910 useless extension candidates. Maximal degree in co-relation 5277. Up to 955 conditions per place. [2022-12-13 00:50:13,680 INFO L137 encePairwiseOnDemand]: 21/32 looper letters, 54 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2022-12-13 00:50:13,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 79 transitions, 652 flow [2022-12-13 00:50:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 00:50:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 00:50:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-13 00:50:13,681 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.65625 [2022-12-13 00:50:13,681 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 331 flow. Second operand 4 states and 84 transitions. [2022-12-13 00:50:13,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 79 transitions, 652 flow [2022-12-13 00:50:13,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 630 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-13 00:50:13,687 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 421 flow [2022-12-13 00:50:13,687 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=421, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-13 00:50:13,687 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 00:50:13,687 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:13,687 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 421 flow [2022-12-13 00:50:13,688 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:13,688 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:13,688 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 421 flow [2022-12-13 00:50:13,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 421 flow [2022-12-13 00:50:13,728 INFO L130 PetriNetUnfolder]: 284/635 cut-off events. [2022-12-13 00:50:13,729 INFO L131 PetriNetUnfolder]: For 1444/2070 co-relation queries the response was YES. [2022-12-13 00:50:13,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 635 events. 284/635 cut-off events. For 1444/2070 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4034 event pairs, 112 based on Foata normal form. 4/391 useless extension candidates. Maximal degree in co-relation 2352. Up to 376 conditions per place. [2022-12-13 00:50:13,732 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 421 flow [2022-12-13 00:50:13,732 INFO L226 LiptonReduction]: Number of co-enabled transitions 514 [2022-12-13 00:50:13,748 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 00:50:13,750 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 00:50:13,750 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 60 transitions, 422 flow [2022-12-13 00:50:13,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:13,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:13,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:13,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 00:50:13,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -628928703, now seen corresponding path program 1 times [2022-12-13 00:50:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490239148] [2022-12-13 00:50:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:13,839 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 00:50:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:13,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490239148] [2022-12-13 00:50:13,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490239148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:13,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:13,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 00:50:13,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764829285] [2022-12-13 00:50:13,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:13,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 00:50:13,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:13,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 00:50:13,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 00:50:13,841 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2022-12-13 00:50:13,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 60 transitions, 422 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 00:50:13,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:13,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2022-12-13 00:50:13,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:13,952 INFO L130 PetriNetUnfolder]: 379/745 cut-off events. [2022-12-13 00:50:13,952 INFO L131 PetriNetUnfolder]: For 2179/2221 co-relation queries the response was YES. [2022-12-13 00:50:13,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3503 conditions, 745 events. 379/745 cut-off events. For 2179/2221 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3684 event pairs, 22 based on Foata normal form. 76/571 useless extension candidates. Maximal degree in co-relation 3481. Up to 388 conditions per place. [2022-12-13 00:50:13,956 INFO L137 encePairwiseOnDemand]: 22/33 looper letters, 45 selfloop transitions, 28 changer transitions 0/79 dead transitions. [2022-12-13 00:50:13,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 708 flow [2022-12-13 00:50:13,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 00:50:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 00:50:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2022-12-13 00:50:13,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2022-12-13 00:50:13,957 INFO L175 Difference]: Start difference. First operand has 58 places, 60 transitions, 422 flow. Second operand 5 states and 91 transitions. [2022-12-13 00:50:13,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 708 flow [2022-12-13 00:50:13,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 632 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-12-13 00:50:13,964 INFO L231 Difference]: Finished difference. Result has 58 places, 60 transitions, 428 flow [2022-12-13 00:50:13,964 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=428, PETRI_PLACES=58, PETRI_TRANSITIONS=60} [2022-12-13 00:50:13,964 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -17 predicate places. [2022-12-13 00:50:13,964 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:13,964 INFO L89 Accepts]: Start accepts. Operand has 58 places, 60 transitions, 428 flow [2022-12-13 00:50:13,965 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:13,965 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:13,966 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 60 transitions, 428 flow [2022-12-13 00:50:13,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 60 transitions, 428 flow [2022-12-13 00:50:13,985 INFO L130 PetriNetUnfolder]: 123/345 cut-off events. [2022-12-13 00:50:13,985 INFO L131 PetriNetUnfolder]: For 280/486 co-relation queries the response was YES. [2022-12-13 00:50:13,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 345 events. 123/345 cut-off events. For 280/486 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 1906 event pairs, 4 based on Foata normal form. 4/180 useless extension candidates. Maximal degree in co-relation 1164. Up to 217 conditions per place. [2022-12-13 00:50:13,987 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 60 transitions, 428 flow [2022-12-13 00:50:13,987 INFO L226 LiptonReduction]: Number of co-enabled transitions 462 [2022-12-13 00:50:14,800 INFO L241 LiptonReduction]: Total number of compositions: 3 [2022-12-13 00:50:14,800 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 836 [2022-12-13 00:50:14,800 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 57 transitions, 422 flow [2022-12-13 00:50:14,801 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 00:50:14,801 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:14,801 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:14,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 00:50:14,801 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:14,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:14,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1949781555, now seen corresponding path program 1 times [2022-12-13 00:50:14,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:14,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519631108] [2022-12-13 00:50:14,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:14,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 00:50:26,562 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 00:50:26,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 00:50:26,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519631108] [2022-12-13 00:50:26,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519631108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 00:50:26,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 00:50:26,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 00:50:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104957091] [2022-12-13 00:50:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 00:50:26,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 00:50:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 00:50:26,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 00:50:26,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 00:50:26,563 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 00:50:26,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 57 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:26,564 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 00:50:26,564 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 00:50:26,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 00:50:26,791 INFO L130 PetriNetUnfolder]: 542/995 cut-off events. [2022-12-13 00:50:26,791 INFO L131 PetriNetUnfolder]: For 2380/2498 co-relation queries the response was YES. [2022-12-13 00:50:26,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4466 conditions, 995 events. 542/995 cut-off events. For 2380/2498 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5232 event pairs, 63 based on Foata normal form. 88/845 useless extension candidates. Maximal degree in co-relation 4446. Up to 532 conditions per place. [2022-12-13 00:50:26,797 INFO L137 encePairwiseOnDemand]: 19/30 looper letters, 65 selfloop transitions, 19 changer transitions 17/114 dead transitions. [2022-12-13 00:50:26,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 114 transitions, 1017 flow [2022-12-13 00:50:26,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 00:50:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 00:50:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 116 transitions. [2022-12-13 00:50:26,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2022-12-13 00:50:26,798 INFO L175 Difference]: Start difference. First operand has 55 places, 57 transitions, 422 flow. Second operand 8 states and 116 transitions. [2022-12-13 00:50:26,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 114 transitions, 1017 flow [2022-12-13 00:50:26,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 114 transitions, 867 flow, removed 30 selfloop flow, removed 3 redundant places. [2022-12-13 00:50:26,806 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 479 flow [2022-12-13 00:50:26,806 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=479, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2022-12-13 00:50:26,806 INFO L295 CegarLoopForPetriNet]: 75 programPoint places, -14 predicate places. [2022-12-13 00:50:26,806 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 00:50:26,806 INFO L89 Accepts]: Start accepts. Operand has 61 places, 64 transitions, 479 flow [2022-12-13 00:50:26,807 INFO L95 Accepts]: Finished accepts. [2022-12-13 00:50:26,807 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 00:50:26,807 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 64 transitions, 479 flow [2022-12-13 00:50:26,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 64 transitions, 479 flow [2022-12-13 00:50:26,831 INFO L130 PetriNetUnfolder]: 222/489 cut-off events. [2022-12-13 00:50:26,831 INFO L131 PetriNetUnfolder]: For 410/436 co-relation queries the response was YES. [2022-12-13 00:50:26,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 489 events. 222/489 cut-off events. For 410/436 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 2769 event pairs, 4 based on Foata normal form. 1/182 useless extension candidates. Maximal degree in co-relation 1433. Up to 226 conditions per place. [2022-12-13 00:50:26,835 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 64 transitions, 479 flow [2022-12-13 00:50:26,835 INFO L226 LiptonReduction]: Number of co-enabled transitions 554 [2022-12-13 00:50:26,853 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [497] $Ultimate##0-->L774: Formula: (and (= |v_P1Thread1of1ForFork0_#in~arg.offset_17| v_P1Thread1of1ForFork0_~arg.offset_17) (= v_~y~0_71 1) (= 2 v_~x~0_149) (= v_P1Thread1of1ForFork0_~arg.base_17 |v_P1Thread1of1ForFork0_#in~arg.base_17|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_17, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_17|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_17|, ~y~0=v_~y~0_71, ~x~0=v_~x~0_149} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] and [501] $Ultimate##0-->L794: Formula: (and (= v_~z~0_676 1) (= v_P2Thread1of1ForFork1_~arg.base_43 |v_P2Thread1of1ForFork1_#in~arg.base_43|) (= v_~y~0_75 v_~__unbuffered_p2_EAX~0_125) (= v_P2Thread1of1ForFork1_~arg.offset_43 |v_P2Thread1of1ForFork1_#in~arg.offset_43|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~y~0=v_~y~0_75} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_43|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_43, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_43, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_125, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_43|, ~z~0=v_~z~0_676, ~y~0=v_~y~0_75} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-13 00:50:26,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [498] $Ultimate##0-->L774: Formula: (and (= 2 v_~x~0_151) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= v_~y~0_73 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~y~0=v_~y~0_73, ~x~0=v_~x~0_151} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] and [496] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_41 |v_P2Thread1of1ForFork1_#in~arg.offset_41|) (= v_P2Thread1of1ForFork1_~arg.base_41 |v_P2Thread1of1ForFork1_#in~arg.base_41|) (= v_~y~0_69 v_~__unbuffered_p2_EAX~0_121) (= v_~z~0_664 1)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_41|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_41|, ~y~0=v_~y~0_69} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_41|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_41, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_41, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_121, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_41|, ~z~0=v_~z~0_664, ~y~0=v_~y~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] [2022-12-13 00:50:26,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [495] $Ultimate##0-->L754: Formula: (and (= v_~z$w_buff0~0_563 2) (= v_~x~0_147 1) (not (= |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_104| 0)) (= v_~z$w_buff0_used~0_810 1) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_104| |v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_104|) (= |v_P0Thread1of1ForFork2_~arg#1.base_102| |v_P0Thread1of1ForFork2_#in~arg#1.base_102|) (= v_~z$r_buff0_thd3~0_164 v_~z$r_buff1_thd3~0_172) (= v_~z$w_buff0~0_564 v_~z$w_buff1~0_506) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_104| (ite (not (and (not (= (mod v_~z$w_buff1_used~0_724 256) 0)) (not (= (mod v_~z$w_buff0_used~0_810 256) 0)))) 1 0)) (= |v_P0Thread1of1ForFork2_#in~arg#1.offset_102| |v_P0Thread1of1ForFork2_~arg#1.offset_102|) (= v_~z$r_buff0_thd1~0_277 v_~z$r_buff1_thd1~0_200) (= v_~z$w_buff0_used~0_811 v_~z$w_buff1_used~0_724) (= v_~z$r_buff0_thd2~0_196 v_~z$r_buff1_thd2~0_204) (= v_~z$r_buff0_thd0~0_418 v_~z$r_buff1_thd0~0_429) (= v_~z$r_buff0_thd1~0_276 1)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_418, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_811, ~z$w_buff0~0=v_~z$w_buff0~0_564, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_102|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_164, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_102|, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_277, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_196} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_810, ~z$w_buff0~0=v_~z$w_buff0~0_563, P0Thread1of1ForFork2_#in~arg#1.base=|v_P0Thread1of1ForFork2_#in~arg#1.base_102|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_172, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_204, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_724, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1_104|, ~z$w_buff1~0=v_~z$w_buff1~0_506, P0Thread1of1ForFork2_#in~arg#1.offset=|v_P0Thread1of1ForFork2_#in~arg#1.offset_102|, P0Thread1of1ForFork2_~arg#1.base=|v_P0Thread1of1ForFork2_~arg#1.base_102|, P0Thread1of1ForFork2_~arg#1.offset=|v_P0Thread1of1ForFork2_~arg#1.offset_102|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_418, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1=|v_P0Thread1of1ForFork2___VERIFIER_assert_~expression#1_104|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_429, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_200, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_164, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_276, ~x~0=v_~x~0_147, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_196} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd2~0, ~z$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression#1, ~z$w_buff1~0, P0Thread1of1ForFork2_~arg#1.base, P0Thread1of1ForFork2_~arg#1.offset, P0Thread1of1ForFork2___VERIFIER_assert_~expression#1, ~z$r_buff1_thd0~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] and [503] $Ultimate##0-->L794: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_47 |v_P2Thread1of1ForFork1_#in~arg.offset_47|) (= v_P2Thread1of1ForFork1_~arg.base_47 |v_P2Thread1of1ForFork1_#in~arg.base_47|) (= v_~z~0_680 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_23| v_P1Thread1of1ForFork0_~arg.offset_23) (= v_~y~0_79 1) (= v_P1Thread1of1ForFork0_~arg.base_23 |v_P1Thread1of1ForFork0_#in~arg.base_23|) (= 2 v_~x~0_157) (= v_~y~0_79 v_~__unbuffered_p2_EAX~0_129)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_47|, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_47|} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_47|, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_23, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_47, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_23, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_47, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_23|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_129, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_47|, ~z~0=v_~z~0_680, ~y~0=v_~y~0_79, ~x~0=v_~x~0_157} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~x~0] [2022-12-13 00:50:27,054 INFO L241 LiptonReduction]: Total number of compositions: 4 [2022-12-13 00:50:27,054 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 248 [2022-12-13 00:50:27,054 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 63 transitions, 487 flow [2022-12-13 00:50:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 00:50:27,055 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 00:50:27,055 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:27,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 00:50:27,055 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 00:50:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 00:50:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 779767767, now seen corresponding path program 1 times [2022-12-13 00:50:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 00:50:27,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112964255] [2022-12-13 00:50:27,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 00:50:27,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 00:50:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:50:27,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 00:50:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 00:50:27,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 00:50:27,133 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 00:50:27,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 00:50:27,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 00:50:27,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 00:50:27,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 00:50:27,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 00:50:27,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 00:50:27,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 00:50:27,138 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 00:50:27,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 00:50:27,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 00:50:27,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:50:27 BasicIcfg [2022-12-13 00:50:27,198 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 00:50:27,198 INFO L158 Benchmark]: Toolchain (without parser) took 35421.61ms. Allocated memory was 177.2MB in the beginning and 985.7MB in the end (delta: 808.5MB). Free memory was 151.9MB in the beginning and 400.2MB in the end (delta: -248.3MB). Peak memory consumption was 561.3MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,198 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 00:50:27,198 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.75ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 125.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,198 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.01ms. Allocated memory is still 177.2MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,199 INFO L158 Benchmark]: Boogie Preprocessor took 44.38ms. Allocated memory is still 177.2MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,199 INFO L158 Benchmark]: RCFGBuilder took 541.88ms. Allocated memory is still 177.2MB. Free memory was 120.6MB in the beginning and 128.5MB in the end (delta: -7.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,201 INFO L158 Benchmark]: TraceAbstraction took 34302.73ms. Allocated memory was 177.2MB in the beginning and 985.7MB in the end (delta: 808.5MB). Free memory was 127.4MB in the beginning and 400.2MB in the end (delta: -272.8MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. [2022-12-13 00:50:27,201 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 466.75ms. Allocated memory is still 177.2MB. Free memory was 151.5MB in the beginning and 125.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.01ms. Allocated memory is still 177.2MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.38ms. Allocated memory is still 177.2MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 541.88ms. Allocated memory is still 177.2MB. Free memory was 120.6MB in the beginning and 128.5MB in the end (delta: -7.8MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * TraceAbstraction took 34302.73ms. Allocated memory was 177.2MB in the beginning and 985.7MB in the end (delta: 808.5MB). Free memory was 127.4MB in the beginning and 400.2MB in the end (delta: -272.8MB). Peak memory consumption was 536.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 112 PlacesBefore, 75 PlacesAfterwards, 104 TransitionsBefore, 67 TransitionsAfterwards, 1920 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 3293, independent unconditional: 0, dependent: 167, dependent conditional: 167, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3460, independent: 3293, independent conditional: 0, independent unconditional: 3293, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1777, independent: 1727, independent conditional: 0, independent unconditional: 1727, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1777, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 83, independent conditional: 0, independent unconditional: 83, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 257, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3460, independent: 1566, independent conditional: 0, independent unconditional: 1566, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1777, unknown conditional: 0, unknown unconditional: 1777] , Statistics on independence cache: Total cache size (in pairs): 2993, Positive cache size: 2943, Positive conditional cache size: 0, Positive unconditional cache size: 2943, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 574 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 257, independent: 223, independent conditional: 223, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 257, independent: 223, independent conditional: 25, independent unconditional: 198, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 257, independent: 223, independent conditional: 25, independent unconditional: 198, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 257, independent: 223, independent conditional: 25, independent unconditional: 198, dependent: 34, dependent conditional: 12, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 211, independent: 187, independent conditional: 24, independent unconditional: 163, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 211, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 24, dependent conditional: 7, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 85, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 70, dependent conditional: 34, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 257, independent: 36, independent conditional: 1, independent unconditional: 35, dependent: 10, dependent conditional: 5, dependent unconditional: 5, unknown: 211, unknown conditional: 31, unknown unconditional: 180] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 187, Positive conditional cache size: 24, Positive unconditional cache size: 163, Negative cache size: 24, Negative conditional cache size: 7, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 45 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 630 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 154, independent: 136, independent conditional: 136, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 154, independent: 136, independent conditional: 2, independent unconditional: 134, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 154, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 154, independent: 136, independent conditional: 0, independent unconditional: 136, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, independent: 123, independent conditional: 0, independent unconditional: 123, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 15, unknown conditional: 0, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 227, Positive conditional cache size: 24, Positive unconditional cache size: 203, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 81, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 6, independent unconditional: 75, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 101, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 101, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 101, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 239, Positive conditional cache size: 24, Positive unconditional cache size: 215, Negative cache size: 28, Negative conditional cache size: 7, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 570 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 35, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 4, independent unconditional: 31, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 242, Positive conditional cache size: 24, Positive unconditional cache size: 218, Negative cache size: 31, Negative conditional cache size: 7, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 41, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 25, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 41, independent conditional: 5, independent unconditional: 36, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 41, independent conditional: 5, independent unconditional: 36, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 1, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 33, independent conditional: 4, independent unconditional: 29, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 287, Positive cache size: 256, Positive conditional cache size: 27, Positive unconditional cache size: 229, Negative cache size: 31, Negative conditional cache size: 7, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 52 PlacesBefore, 52 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 64, independent conditional: 64, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 68, independent: 64, independent conditional: 48, independent unconditional: 16, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 64, independent conditional: 40, independent unconditional: 24, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 64, independent conditional: 40, independent unconditional: 24, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 14, independent conditional: 14, independent unconditional: 0, 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: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 50, independent conditional: 26, independent unconditional: 24, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 276, Positive conditional cache size: 41, Positive unconditional cache size: 235, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 54 PlacesBefore, 53 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 59, independent conditional: 44, independent unconditional: 15, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 59, independent conditional: 10, independent unconditional: 49, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 59, independent conditional: 10, independent unconditional: 49, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 64, independent: 54, independent conditional: 10, independent unconditional: 44, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 316, Positive cache size: 284, Positive conditional cache size: 41, Positive unconditional cache size: 243, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 55 PlacesBefore, 55 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 662 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 50, independent conditional: 50, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 50, independent conditional: 26, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 50, independent conditional: 14, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 49, independent conditional: 14, independent unconditional: 35, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 318, Positive cache size: 286, Positive conditional cache size: 41, Positive unconditional cache size: 245, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 56 PlacesBefore, 57 PlacesAfterwards, 54 TransitionsBefore, 55 TransitionsAfterwards, 706 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 78, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 54, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 84, independent: 78, independent conditional: 42, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 84, independent: 78, independent conditional: 42, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, independent: 63, independent conditional: 27, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 301, Positive conditional cache size: 56, Positive unconditional cache size: 245, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.7s, 61 PlacesBefore, 60 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 89, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 89, independent: 80, independent conditional: 50, independent unconditional: 30, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 89, independent: 80, independent conditional: 32, independent unconditional: 48, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 89, independent: 80, independent conditional: 32, independent unconditional: 48, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 89, independent: 77, independent conditional: 29, independent unconditional: 48, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 307, Positive conditional cache size: 59, Positive unconditional cache size: 248, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 20, independent unconditional: 10, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, independent: 30, independent conditional: 10, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 307, Positive conditional cache size: 59, Positive unconditional cache size: 248, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 60, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 42, independent unconditional: 18, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 66, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 66, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 66, independent: 60, independent conditional: 24, independent unconditional: 36, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 307, Positive conditional cache size: 59, Positive unconditional cache size: 248, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1028 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 307, Positive conditional cache size: 59, Positive unconditional cache size: 248, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1096 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 42, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 30, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 48, independent: 42, independent conditional: 12, independent unconditional: 30, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 339, Positive cache size: 307, Positive conditional cache size: 59, Positive unconditional cache size: 248, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 68 PlacesBefore, 68 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 666 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 51, independent: 45, independent conditional: 33, independent unconditional: 12, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, independent: 45, independent conditional: 6, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, independent: 45, independent conditional: 6, independent unconditional: 39, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, independent: 43, independent conditional: 6, independent unconditional: 37, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 333, Positive conditional cache size: 59, Positive unconditional cache size: 274, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 365, Positive cache size: 333, Positive conditional cache size: 59, Positive unconditional cache size: 274, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 56 PlacesBefore, 55 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 530 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 30, independent conditional: 22, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 30, independent: 23, independent conditional: 15, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 360, Positive conditional cache size: 68, Positive unconditional cache size: 292, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 372, Positive conditional cache size: 70, Positive unconditional cache size: 302, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 58 PlacesBefore, 55 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 9, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 388, Positive conditional cache size: 72, Positive unconditional cache size: 316, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 61 PlacesBefore, 60 PlacesAfterwards, 64 TransitionsBefore, 63 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, independent: 34, independent conditional: 8, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, independent: 34, independent conditional: 8, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 7, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, independent: 17, independent conditional: 1, independent unconditional: 16, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17, unknown conditional: 7, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 449, Positive cache size: 417, Positive conditional cache size: 85, Positive unconditional cache size: 332, Negative cache size: 32, Negative conditional cache size: 8, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025; [L819] FCALL, FORK 0 pthread_create(&t2025, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025, ((void *)0), P0, ((void *)0))=-3, t2025={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2026; [L821] FCALL, FORK 0 pthread_create(&t2026, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2026, ((void *)0), P1, ((void *)0))=-2, t2025={5:0}, t2026={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2027; [L823] FCALL, FORK 0 pthread_create(&t2027, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2027, ((void *)0), P2, ((void *)0))=-1, t2025={5:0}, t2026={6:0}, t2027={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 [L753] 1 x = 1 [L770] 1 x = 2 [L773] 1 y = 1 [L790] 1 __unbuffered_p2_EAX = y [L793] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 20 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=14, InterpolantAutomatonStates: 79, 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.3s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 2931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 00:50:27,232 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...