/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:16:47,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:16:47,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:16:47,336 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:16:47,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:16:47,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:16:47,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:16:47,346 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:16:47,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:16:47,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:16:47,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:16:47,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:16:47,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:16:47,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:16:47,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:16:47,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:16:47,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:16:47,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:16:47,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:16:47,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:16:47,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:16:47,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:16:47,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:16:47,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:16:47,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:16:47,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:16:47,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:16:47,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:16:47,365 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:16:47,366 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:16:47,366 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:16:47,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:16:47,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:16:47,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:16:47,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:16:47,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:16:47,369 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:16:47,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:16:47,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:16:47,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:16:47,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:16:47,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:16:47,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:16:47,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:16:47,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:16:47,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:16:47,412 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:16:47,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:16:47,413 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:16:47,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:16:47,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:16:47,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:16:47,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:16:47,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:47,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:16:47,415 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:16:47,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:16:47,416 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:16:47,416 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:16:47,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:16:47,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:16:47,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:16:47,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:16:47,702 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:16:47,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-06 04:16:48,642 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:16:48,908 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:16:48,909 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042.opt.i [2022-12-06 04:16:48,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89c70c9f/3ec4b57dfc3b4729827d1378c478506c/FLAG0b4d6cc17 [2022-12-06 04:16:48,934 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a89c70c9f/3ec4b57dfc3b4729827d1378c478506c [2022-12-06 04:16:48,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:16:48,937 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:16:48,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:48,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:16:48,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:16:48,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:48" (1/1) ... [2022-12-06 04:16:48,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ee2a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:48, skipping insertion in model container [2022-12-06 04:16:48,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:16:48" (1/1) ... [2022-12-06 04:16:48,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:16:48,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:16:49,127 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/mix042.opt.i[944,957] [2022-12-06 04:16:49,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,259 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:49,303 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:16:49,314 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/mix042.opt.i[944,957] [2022-12-06 04:16:49,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,365 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:16:49,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:16:49,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:16:49,396 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:16:49,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49 WrapperNode [2022-12-06 04:16:49,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:16:49,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:49,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:16:49,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:16:49,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,438 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2022-12-06 04:16:49,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:16:49,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:16:49,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:16:49,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:16:49,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,455 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:16:49,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:16:49,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:16:49,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:16:49,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (1/1) ... [2022-12-06 04:16:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:16:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:16:49,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:16:49,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:16:49,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:16:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:16:49,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:16:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 04:16:49,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 04:16:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:16:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:16:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:16:49,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:16:49,550 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:16:49,689 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:16:49,691 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:16:49,949 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:16:50,048 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:16:50,048 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:16:50,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:50 BoogieIcfgContainer [2022-12-06 04:16:50,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:16:50,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:16:50,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:16:50,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:16:50,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:16:48" (1/3) ... [2022-12-06 04:16:50,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb48c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:50, skipping insertion in model container [2022-12-06 04:16:50,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:16:49" (2/3) ... [2022-12-06 04:16:50,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb48c53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:16:50, skipping insertion in model container [2022-12-06 04:16:50,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:16:50" (3/3) ... [2022-12-06 04:16:50,059 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.opt.i [2022-12-06 04:16:50,072 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:16:50,073 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 04:16:50,073 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:16:50,118 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:16:50,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:16:50,197 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:16:50,198 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:50,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:16:50,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-06 04:16:50,207 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-06 04:16:50,208 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:50,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:16:50,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-06 04:16:50,259 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-06 04:16:50,260 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:50,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-06 04:16:50,262 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-06 04:16:50,262 INFO L188 LiptonReduction]: Number of co-enabled transitions 1944 [2022-12-06 04:16:54,437 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 04:16:54,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:16:54,459 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;@48fe5dd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:16:54,460 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 04:16:54,465 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-06 04:16:54,465 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:54,466 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:54,466 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:54,467 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:54,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1710845184, now seen corresponding path program 1 times [2022-12-06 04:16:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:54,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883418355] [2022-12-06 04:16:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:54,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:54,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883418355] [2022-12-06 04:16:54,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883418355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:54,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:54,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:16:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743609815] [2022-12-06 04:16:54,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:54,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:16:54,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:54,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:16:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:16:54,879 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-06 04:16:54,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:54,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:54,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-06 04:16:54,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:55,086 INFO L130 PetriNetUnfolder]: 615/1083 cut-off events. [2022-12-06 04:16:55,086 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 04:16:55,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2054 conditions, 1083 events. 615/1083 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5733 event pairs, 129 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 2043. Up to 703 conditions per place. [2022-12-06 04:16:55,092 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 23 selfloop transitions, 2 changer transitions 4/33 dead transitions. [2022-12-06 04:16:55,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 133 flow [2022-12-06 04:16:55,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 04:16:55,100 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 04:16:55,101 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-06 04:16:55,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 133 flow [2022-12-06 04:16:55,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:16:55,104 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-06 04:16:55,105 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-06 04:16:55,108 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 04:16:55,108 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:55,109 INFO L89 Accepts]: Start accepts. Operand has 32 places, 21 transitions, 52 flow [2022-12-06 04:16:55,110 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:55,111 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:55,111 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 52 flow [2022-12-06 04:16:55,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 52 flow [2022-12-06 04:16:55,115 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:16:55,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:55,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 04:16:55,115 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 52 flow [2022-12-06 04:16:55,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 206 [2022-12-06 04:16:55,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:55,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 91 [2022-12-06 04:16:55,199 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-06 04:16:55,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:55,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:55,200 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:16:55,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:55,200 INFO L85 PathProgramCache]: Analyzing trace with hash -850218001, now seen corresponding path program 1 times [2022-12-06 04:16:55,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:55,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287183275] [2022-12-06 04:16:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:55,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287183275] [2022-12-06 04:16:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287183275] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:55,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:16:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370258673] [2022-12-06 04:16:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:55,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:16:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:16:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:16:55,583 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-06 04:16:55,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:55,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:55,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-06 04:16:55,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:55,737 INFO L130 PetriNetUnfolder]: 991/1480 cut-off events. [2022-12-06 04:16:55,738 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-12-06 04:16:55,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3074 conditions, 1480 events. 991/1480 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5650 event pairs, 335 based on Foata normal form. 40/1520 useless extension candidates. Maximal degree in co-relation 3064. Up to 1037 conditions per place. [2022-12-06 04:16:55,746 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-06 04:16:55,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 30 transitions, 130 flow [2022-12-06 04:16:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:16:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:16:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 04:16:55,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2022-12-06 04:16:55,748 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 31 transitions. [2022-12-06 04:16:55,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 30 transitions, 130 flow [2022-12-06 04:16:55,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:55,751 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 56 flow [2022-12-06 04:16:55,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-06 04:16:55,751 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -4 predicate places. [2022-12-06 04:16:55,751 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:55,751 INFO L89 Accepts]: Start accepts. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:16:55,752 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:55,752 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:55,752 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:16:55,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 21 transitions, 56 flow [2022-12-06 04:16:55,756 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-06 04:16:55,756 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:16:55,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:16:55,756 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 21 transitions, 56 flow [2022-12-06 04:16:55,756 INFO L188 LiptonReduction]: Number of co-enabled transitions 202 [2022-12-06 04:16:55,888 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:55,889 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 138 [2022-12-06 04:16:55,889 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2022-12-06 04:16:55,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:55,889 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:55,889 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:55,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:16:55,890 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:55,890 INFO L85 PathProgramCache]: Analyzing trace with hash -586922874, now seen corresponding path program 1 times [2022-12-06 04:16:55,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:55,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161429199] [2022-12-06 04:16:55,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:56,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:56,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161429199] [2022-12-06 04:16:56,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161429199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:56,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:56,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:56,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096798927] [2022-12-06 04:16:56,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:56,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:56,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:56,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:56,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:56,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-06 04:16:56,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:56,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:56,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-06 04:16:56,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:56,392 INFO L130 PetriNetUnfolder]: 515/839 cut-off events. [2022-12-06 04:16:56,392 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-06 04:16:56,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1809 conditions, 839 events. 515/839 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3786 event pairs, 87 based on Foata normal form. 9/847 useless extension candidates. Maximal degree in co-relation 1798. Up to 619 conditions per place. [2022-12-06 04:16:56,397 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 36 selfloop transitions, 9 changer transitions 0/47 dead transitions. [2022-12-06 04:16:56,397 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 208 flow [2022-12-06 04:16:56,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:56,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-12-06 04:16:56,398 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-06 04:16:56,398 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 5 states and 57 transitions. [2022-12-06 04:16:56,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 208 flow [2022-12-06 04:16:56,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:16:56,400 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,400 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2022-12-06 04:16:56,401 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 04:16:56,401 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:56,401 INFO L89 Accepts]: Start accepts. Operand has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,401 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:56,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:56,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,418 INFO L130 PetriNetUnfolder]: 9/52 cut-off events. [2022-12-06 04:16:56,418 INFO L131 PetriNetUnfolder]: For 27/32 co-relation queries the response was YES. [2022-12-06 04:16:56,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 52 events. 9/52 cut-off events. For 27/32 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 2 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 04:16:56,419 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,419 INFO L188 LiptonReduction]: Number of co-enabled transitions 258 [2022-12-06 04:16:56,421 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:56,421 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 04:16:56,422 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 115 flow [2022-12-06 04:16:56,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:56,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:56,422 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:56,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:16:56,422 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -586953564, now seen corresponding path program 2 times [2022-12-06 04:16:56,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:56,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729604194] [2022-12-06 04:16:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:57,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729604194] [2022-12-06 04:16:57,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729604194] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:57,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:57,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123540583] [2022-12-06 04:16:57,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:57,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:57,005 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 04:16:57,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 115 flow. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:57,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 04:16:57,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:57,239 INFO L130 PetriNetUnfolder]: 998/1495 cut-off events. [2022-12-06 04:16:57,239 INFO L131 PetriNetUnfolder]: For 828/828 co-relation queries the response was YES. [2022-12-06 04:16:57,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4100 conditions, 1495 events. 998/1495 cut-off events. For 828/828 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5993 event pairs, 213 based on Foata normal form. 12/1507 useless extension candidates. Maximal degree in co-relation 4086. Up to 1182 conditions per place. [2022-12-06 04:16:57,248 INFO L137 encePairwiseOnDemand]: 11/20 looper letters, 47 selfloop transitions, 22 changer transitions 0/69 dead transitions. [2022-12-06 04:16:57,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 69 transitions, 389 flow [2022-12-06 04:16:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:16:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:16:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-12-06 04:16:57,250 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 04:16:57,250 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 115 flow. Second operand 6 states and 60 transitions. [2022-12-06 04:16:57,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 69 transitions, 389 flow [2022-12-06 04:16:57,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 69 transitions, 389 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:57,253 INFO L231 Difference]: Finished difference. Result has 43 places, 47 transitions, 302 flow [2022-12-06 04:16:57,253 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=302, PETRI_PLACES=43, PETRI_TRANSITIONS=47} [2022-12-06 04:16:57,253 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 04:16:57,253 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:57,254 INFO L89 Accepts]: Start accepts. Operand has 43 places, 47 transitions, 302 flow [2022-12-06 04:16:57,254 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:57,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:57,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 47 transitions, 302 flow [2022-12-06 04:16:57,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 47 transitions, 302 flow [2022-12-06 04:16:57,275 INFO L130 PetriNetUnfolder]: 96/207 cut-off events. [2022-12-06 04:16:57,275 INFO L131 PetriNetUnfolder]: For 499/510 co-relation queries the response was YES. [2022-12-06 04:16:57,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 207 events. 96/207 cut-off events. For 499/510 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 901 event pairs, 10 based on Foata normal form. 1/202 useless extension candidates. Maximal degree in co-relation 756. Up to 102 conditions per place. [2022-12-06 04:16:57,277 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 47 transitions, 302 flow [2022-12-06 04:16:57,277 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 04:16:57,279 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] $Ultimate##0-->L798: Formula: (and (= v_~y$r_buff0_thd0~0_275 v_~y$r_buff1_thd0~0_270) (= 2 v_~y$w_buff0~0_276) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= |v_P2Thread1of1ForFork1_~arg#1.base_40| |v_P2Thread1of1ForFork1_#in~arg#1.base_40|) (= v_~y$w_buff0_used~0_425 1) (= v_~z~0_51 1) (= v_~y$w_buff0_used~0_426 v_~y$w_buff1_used~0_386) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_40| |v_P2Thread1of1ForFork1_~arg#1.offset_40|) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_89) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= v_~y$r_buff0_thd2~0_118 v_~y$r_buff1_thd2~0_119) (= v_~y$r_buff0_thd3~0_153 v_~y$r_buff1_thd3~0_114) (= v_~y$w_buff1~0_241 v_~y$w_buff0~0_277) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_425 256) 0)) (not (= (mod v_~y$w_buff1_used~0_386 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$r_buff0_thd3~0_152 1)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_426, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_153, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_277, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_40|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff1~0=v_~y$w_buff1~0_241, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_276, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~z~0=v_~z~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_386} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [328] L763-->L766: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] [2022-12-06 04:16:57,374 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:57,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 122 [2022-12-06 04:16:57,375 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 47 transitions, 308 flow [2022-12-06 04:16:57,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:57,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:57,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:16:57,376 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:57,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1015694112, now seen corresponding path program 1 times [2022-12-06 04:16:57,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:57,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902514291] [2022-12-06 04:16:57,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:57,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:57,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:57,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902514291] [2022-12-06 04:16:57,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902514291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:57,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:57,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:16:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925906032] [2022-12-06 04:16:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:57,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:16:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:57,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:16:57,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:16:57,695 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:16:57,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:57,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:16:57,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:57,863 INFO L130 PetriNetUnfolder]: 791/1243 cut-off events. [2022-12-06 04:16:57,865 INFO L131 PetriNetUnfolder]: For 2855/2914 co-relation queries the response was YES. [2022-12-06 04:16:57,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4517 conditions, 1243 events. 791/1243 cut-off events. For 2855/2914 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5750 event pairs, 179 based on Foata normal form. 10/1194 useless extension candidates. Maximal degree in co-relation 4498. Up to 927 conditions per place. [2022-12-06 04:16:57,879 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 37 selfloop transitions, 13 changer transitions 0/56 dead transitions. [2022-12-06 04:16:57,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 419 flow [2022-12-06 04:16:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:16:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:16:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:16:57,881 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2022-12-06 04:16:57,881 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 308 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:16:57,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 419 flow [2022-12-06 04:16:57,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 401 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-12-06 04:16:57,891 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,891 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2022-12-06 04:16:57,893 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-06 04:16:57,893 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:57,893 INFO L89 Accepts]: Start accepts. Operand has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,894 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:57,894 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:57,894 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,920 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([443] L841-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_154 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_160 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_255 256) 0)) (.cse3 (and .cse10 (= (mod v_~y$w_buff1_used~0_229 256) 0)))) (let ((.cse4 (or .cse1 .cse12 .cse3)) (.cse5 (and .cse11 (not .cse12)))) (let ((.cse6 (ite .cse4 v_~y~0_179 (ite .cse5 v_~y$w_buff0~0_151 v_~y$w_buff1~0_126))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse8 (= (mod v_~y$w_buff1_used~0_228 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (and (= v_~y$w_buff1~0_126 v_~y$w_buff1~0_125) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|) (= 0 v_~y$flush_delayed~0_47) (= v_~y$w_buff0~0_151 v_~y$w_buff0~0_150) (= v_~y$w_buff1_used~0_228 (ite .cse0 v_~y$w_buff1_used~0_229 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_229 0))) (= v_~y~0_179 v_~y$mem_tmp~0_50) (= v_~weak$$choice2~0_50 |v_ULTIMATE.start_main_#t~nondet10#1_59|) (= v_~weak$$choice0~0_31 |v_ULTIMATE.start_main_#t~nondet9#1_61|) (= v_~y$w_buff0_used~0_254 (ite .cse0 v_~y$w_buff0_used~0_255 (ite .cse4 v_~y$w_buff0_used~0_255 (ite .cse5 0 v_~y$w_buff0_used~0_255)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_50 0) (= 2 .cse6) (= v_~__unbuffered_p0_EAX~0_46 0) (= v_~__unbuffered_p2_EAX~0_44 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_56) (= v_~y$r_buff1_thd0~0_153 (ite .cse0 v_~y$r_buff1_thd0~0_154 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_159 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse7) .cse2)) v_~y$r_buff1_thd0~0_154 0))) (= v_~y~0_178 (ite .cse0 v_~y$mem_tmp~0_50 .cse6)) (= (ite .cse0 v_~y$r_buff0_thd0~0_160 (ite (or (and .cse10 .cse8) .cse1 .cse2) v_~y$r_buff0_thd0~0_160 (ite (and .cse11 (not .cse2)) 0 v_~y$r_buff0_thd0~0_160))) v_~y$r_buff0_thd0~0_159)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_255, ~y$w_buff1~0=v_~y$w_buff1~0_126, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_61|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_160, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_229} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_31, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|, ~y$w_buff1~0=v_~y$w_buff1~0_125, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][43], [Black: 129#(= ~__unbuffered_p2_EAX~0 0), 132#true, Black: 136#(and (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 0) (< 0 (+ ~y$r_buff0_thd0~0 1))), 43#L751true, 152#true, Black: 138#(and (= ~y~0 0) (= ~y~0 ~y$w_buff0~0) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 0) (< 0 (+ ~y$r_buff0_thd0~0 1))), Black: 135#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= ~y~0 ~y$w_buff0~0))), 17#L766true, 27#L808true, P0Thread1of1ForFork2InUse, Black: 146#(and (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), P1Thread1of1ForFork0InUse, Black: 145#(and (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0)), Black: 148#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork1InUse, 98#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 142#true]) [2022-12-06 04:16:57,921 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 04:16:57,921 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 04:16:57,921 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 04:16:57,921 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 04:16:57,924 INFO L130 PetriNetUnfolder]: 99/221 cut-off events. [2022-12-06 04:16:57,924 INFO L131 PetriNetUnfolder]: For 608/633 co-relation queries the response was YES. [2022-12-06 04:16:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 221 events. 99/221 cut-off events. For 608/633 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1005 event pairs, 24 based on Foata normal form. 1/207 useless extension candidates. Maximal degree in co-relation 778. Up to 118 conditions per place. [2022-12-06 04:16:57,925 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,926 INFO L188 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-06 04:16:57,932 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:57,933 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-06 04:16:57,933 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 305 flow [2022-12-06 04:16:57,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:57,933 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:57,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:57,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:16:57,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:57,934 INFO L85 PathProgramCache]: Analyzing trace with hash -330708012, now seen corresponding path program 1 times [2022-12-06 04:16:57,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:57,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599267002] [2022-12-06 04:16:57,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:57,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:58,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:58,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599267002] [2022-12-06 04:16:58,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599267002] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:58,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:58,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:58,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104476067] [2022-12-06 04:16:58,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:58,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:58,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:58,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:58,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:16:58,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:58,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:58,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:16:58,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:58,462 INFO L130 PetriNetUnfolder]: 851/1333 cut-off events. [2022-12-06 04:16:58,463 INFO L131 PetriNetUnfolder]: For 3030/3098 co-relation queries the response was YES. [2022-12-06 04:16:58,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4779 conditions, 1333 events. 851/1333 cut-off events. For 3030/3098 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 6238 event pairs, 225 based on Foata normal form. 8/1287 useless extension candidates. Maximal degree in co-relation 4758. Up to 885 conditions per place. [2022-12-06 04:16:58,471 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 46 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2022-12-06 04:16:58,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 534 flow [2022-12-06 04:16:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 04:16:58,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2022-12-06 04:16:58,473 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 305 flow. Second operand 5 states and 52 transitions. [2022-12-06 04:16:58,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 534 flow [2022-12-06 04:16:58,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 508 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 04:16:58,477 INFO L231 Difference]: Finished difference. Result has 49 places, 55 transitions, 405 flow [2022-12-06 04:16:58,478 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=405, PETRI_PLACES=49, PETRI_TRANSITIONS=55} [2022-12-06 04:16:58,478 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2022-12-06 04:16:58,478 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:58,478 INFO L89 Accepts]: Start accepts. Operand has 49 places, 55 transitions, 405 flow [2022-12-06 04:16:58,479 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:58,479 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:58,479 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 55 transitions, 405 flow [2022-12-06 04:16:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 55 transitions, 405 flow [2022-12-06 04:16:58,500 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([443] L841-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse9 (= (mod v_~y$r_buff1_thd0~0_154 256) 0)) (.cse10 (= (mod v_~y$r_buff0_thd0~0_160 256) 0))) (let ((.cse11 (not .cse10)) (.cse1 (and .cse10 .cse9)) (.cse12 (= (mod v_~y$w_buff0_used~0_255 256) 0)) (.cse3 (and .cse10 (= (mod v_~y$w_buff1_used~0_229 256) 0)))) (let ((.cse4 (or .cse1 .cse12 .cse3)) (.cse5 (and .cse11 (not .cse12)))) (let ((.cse6 (ite .cse4 v_~y~0_179 (ite .cse5 v_~y$w_buff0~0_151 v_~y$w_buff1~0_126))) (.cse0 (not (= (mod v_~weak$$choice2~0_50 256) 0))) (.cse8 (= (mod v_~y$w_buff1_used~0_228 256) 0)) (.cse2 (= (mod v_~y$w_buff0_used~0_254 256) 0))) (and (= v_~y$w_buff1~0_126 v_~y$w_buff1~0_125) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35| 0) (= (mod v_~main$tmp_guard1~0_56 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|) (= 0 v_~y$flush_delayed~0_47) (= v_~y$w_buff0~0_151 v_~y$w_buff0~0_150) (= v_~y$w_buff1_used~0_228 (ite .cse0 v_~y$w_buff1_used~0_229 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_229 0))) (= v_~y~0_179 v_~y$mem_tmp~0_50) (= v_~weak$$choice2~0_50 |v_ULTIMATE.start_main_#t~nondet10#1_59|) (= v_~weak$$choice0~0_31 |v_ULTIMATE.start_main_#t~nondet9#1_61|) (= v_~y$w_buff0_used~0_254 (ite .cse0 v_~y$w_buff0_used~0_255 (ite .cse4 v_~y$w_buff0_used~0_255 (ite .cse5 0 v_~y$w_buff0_used~0_255)))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|) (= (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_50 0) (= 2 .cse6) (= v_~__unbuffered_p0_EAX~0_46 0) (= v_~__unbuffered_p2_EAX~0_44 1))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_56) (= v_~y$r_buff1_thd0~0_153 (ite .cse0 v_~y$r_buff1_thd0~0_154 (ite (let ((.cse7 (= (mod v_~y$r_buff0_thd0~0_159 256) 0))) (or (and .cse7 .cse8) (and .cse9 .cse7) .cse2)) v_~y$r_buff1_thd0~0_154 0))) (= v_~y~0_178 (ite .cse0 v_~y$mem_tmp~0_50 .cse6)) (= (ite .cse0 v_~y$r_buff0_thd0~0_160 (ite (or (and .cse10 .cse8) .cse1 .cse2) v_~y$r_buff0_thd0~0_160 (ite (and .cse11 (not .cse2)) 0 v_~y$r_buff0_thd0~0_160))) v_~y$r_buff0_thd0~0_159)))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_59|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_255, ~y$w_buff1~0=v_~y$w_buff1~0_126, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_61|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_160, ~y$w_buff0~0=v_~y$w_buff0~0_151, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_179, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_154, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_229} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_31, ~y$mem_tmp~0=v_~y$mem_tmp~0_50, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_29|, ~y$w_buff1~0=v_~y$w_buff1~0_125, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, ~y$w_buff0~0=v_~y$w_buff0~0_150, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_44, ~y~0=v_~y~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_50, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_228} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet9#1, ~main$tmp_guard1~0, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][52], [132#true, Black: 129#(= ~__unbuffered_p2_EAX~0 0), Black: 161#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), Black: 160#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 157#true, 43#L751true, Black: 136#(and (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 0) (< 0 (+ ~y$r_buff0_thd0~0 1))), Black: 138#(and (= ~y~0 0) (= ~y~0 ~y$w_buff0~0) (not (= 2 ~y$w_buff1~0)) (<= ~y$r_buff0_thd0~0 0) (< 0 (+ ~y$r_buff0_thd0~0 1))), Black: 135#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 ~y$w_buff1~0) (= 2 ~y$w_buff0~0) (not (= ~y~0 ~y$w_buff0~0))), 17#L766true, 27#L808true, P0Thread1of1ForFork2InUse, Black: 146#(and (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0))) (or (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))))), P1Thread1of1ForFork0InUse, Black: 145#(and (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0)), Black: 148#(and (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0))) (= ~y~0 0) (<= 0 ~y$r_buff0_thd0~0) (<= ~y$r_buff0_thd0~0 0)), P2Thread1of1ForFork1InUse, 98#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 142#true]) [2022-12-06 04:16:58,501 INFO L382 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2022-12-06 04:16:58,501 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 04:16:58,501 INFO L385 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2022-12-06 04:16:58,501 INFO L385 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2022-12-06 04:16:58,503 INFO L130 PetriNetUnfolder]: 110/245 cut-off events. [2022-12-06 04:16:58,503 INFO L131 PetriNetUnfolder]: For 811/838 co-relation queries the response was YES. [2022-12-06 04:16:58,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 245 events. 110/245 cut-off events. For 811/838 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1169 event pairs, 26 based on Foata normal form. 8/239 useless extension candidates. Maximal degree in co-relation 984. Up to 132 conditions per place. [2022-12-06 04:16:58,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 55 transitions, 405 flow [2022-12-06 04:16:58,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 388 [2022-12-06 04:16:59,099 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:16:59,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 622 [2022-12-06 04:16:59,100 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 55 transitions, 419 flow [2022-12-06 04:16:59,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:59,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:59,101 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:59,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:16:59,101 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:59,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:59,101 INFO L85 PathProgramCache]: Analyzing trace with hash -330738702, now seen corresponding path program 2 times [2022-12-06 04:16:59,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:59,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387619860] [2022-12-06 04:16:59,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:59,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:59,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387619860] [2022-12-06 04:16:59,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387619860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:59,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:59,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844915852] [2022-12-06 04:16:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:59,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:59,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:59,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:59,367 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 22 [2022-12-06 04:16:59,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 55 transitions, 419 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:59,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:59,367 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 22 [2022-12-06 04:16:59,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:16:59,569 INFO L130 PetriNetUnfolder]: 910/1448 cut-off events. [2022-12-06 04:16:59,569 INFO L131 PetriNetUnfolder]: For 4480/4533 co-relation queries the response was YES. [2022-12-06 04:16:59,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5634 conditions, 1448 events. 910/1448 cut-off events. For 4480/4533 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 7028 event pairs, 182 based on Foata normal form. 25/1424 useless extension candidates. Maximal degree in co-relation 5611. Up to 928 conditions per place. [2022-12-06 04:16:59,580 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 52 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2022-12-06 04:16:59,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 77 transitions, 645 flow [2022-12-06 04:16:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:16:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:16:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2022-12-06 04:16:59,582 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2022-12-06 04:16:59,582 INFO L175 Difference]: Start difference. First operand has 49 places, 55 transitions, 419 flow. Second operand 5 states and 52 transitions. [2022-12-06 04:16:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 77 transitions, 645 flow [2022-12-06 04:16:59,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 627 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 04:16:59,589 INFO L231 Difference]: Finished difference. Result has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,589 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=506, PETRI_PLACES=53, PETRI_TRANSITIONS=61} [2022-12-06 04:16:59,590 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 04:16:59,590 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:16:59,590 INFO L89 Accepts]: Start accepts. Operand has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,590 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:16:59,590 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:16:59,591 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,615 INFO L130 PetriNetUnfolder]: 125/271 cut-off events. [2022-12-06 04:16:59,615 INFO L131 PetriNetUnfolder]: For 1041/1068 co-relation queries the response was YES. [2022-12-06 04:16:59,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 271 events. 125/271 cut-off events. For 1041/1068 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1310 event pairs, 27 based on Foata normal form. 10/262 useless extension candidates. Maximal degree in co-relation 1152. Up to 144 conditions per place. [2022-12-06 04:16:59,618 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,618 INFO L188 LiptonReduction]: Number of co-enabled transitions 416 [2022-12-06 04:16:59,620 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:16:59,621 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 04:16:59,621 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 61 transitions, 506 flow [2022-12-06 04:16:59,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:59,621 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:16:59,621 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:16:59,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:16:59,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:16:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:16:59,622 INFO L85 PathProgramCache]: Analyzing trace with hash -327131170, now seen corresponding path program 1 times [2022-12-06 04:16:59,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:16:59,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071716283] [2022-12-06 04:16:59,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:16:59,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:16:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:16:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:16:59,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:16:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071716283] [2022-12-06 04:16:59,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071716283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:16:59,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:16:59,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:16:59,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359082914] [2022-12-06 04:16:59,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:16:59,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:16:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:16:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:16:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:16:59,963 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 04:16:59,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 61 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:16:59,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:16:59,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 04:16:59,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:00,250 INFO L130 PetriNetUnfolder]: 977/1563 cut-off events. [2022-12-06 04:17:00,250 INFO L131 PetriNetUnfolder]: For 6472/6551 co-relation queries the response was YES. [2022-12-06 04:17:00,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6366 conditions, 1563 events. 977/1563 cut-off events. For 6472/6551 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7811 event pairs, 247 based on Foata normal form. 36/1548 useless extension candidates. Maximal degree in co-relation 6341. Up to 681 conditions per place. [2022-12-06 04:17:00,264 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 54 selfloop transitions, 28 changer transitions 0/88 dead transitions. [2022-12-06 04:17:00,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 88 transitions, 784 flow [2022-12-06 04:17:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-06 04:17:00,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2022-12-06 04:17:00,267 INFO L175 Difference]: Start difference. First operand has 53 places, 61 transitions, 506 flow. Second operand 6 states and 65 transitions. [2022-12-06 04:17:00,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 88 transitions, 784 flow [2022-12-06 04:17:00,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 88 transitions, 757 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 04:17:00,280 INFO L231 Difference]: Finished difference. Result has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=58, PETRI_TRANSITIONS=65} [2022-12-06 04:17:00,282 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2022-12-06 04:17:00,282 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:00,282 INFO L89 Accepts]: Start accepts. Operand has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,284 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:00,284 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:00,284 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,315 INFO L130 PetriNetUnfolder]: 121/277 cut-off events. [2022-12-06 04:17:00,316 INFO L131 PetriNetUnfolder]: For 1342/1365 co-relation queries the response was YES. [2022-12-06 04:17:00,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 277 events. 121/277 cut-off events. For 1342/1365 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1437 event pairs, 33 based on Foata normal form. 10/270 useless extension candidates. Maximal degree in co-relation 1243. Up to 140 conditions per place. [2022-12-06 04:17:00,319 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,319 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 04:17:00,324 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:17:00,325 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-06 04:17:00,326 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 65 transitions, 611 flow [2022-12-06 04:17:00,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:00,326 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:00,326 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:00,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:17:00,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:17:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1394635961, now seen corresponding path program 1 times [2022-12-06 04:17:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:00,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465665776] [2022-12-06 04:17:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:00,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:00,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:00,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:00,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465665776] [2022-12-06 04:17:00,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465665776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:00,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:00,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:17:00,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514819993] [2022-12-06 04:17:00,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:00,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:17:00,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:00,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:17:00,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:17:00,441 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-06 04:17:00,441 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 65 transitions, 611 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:00,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:00,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-06 04:17:00,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:00,605 INFO L130 PetriNetUnfolder]: 656/1129 cut-off events. [2022-12-06 04:17:00,605 INFO L131 PetriNetUnfolder]: For 7065/7215 co-relation queries the response was YES. [2022-12-06 04:17:00,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 1129 events. 656/1129 cut-off events. For 7065/7215 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6003 event pairs, 118 based on Foata normal form. 177/1262 useless extension candidates. Maximal degree in co-relation 4820. Up to 637 conditions per place. [2022-12-06 04:17:00,618 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 103 selfloop transitions, 7 changer transitions 19/142 dead transitions. [2022-12-06 04:17:00,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 1660 flow [2022-12-06 04:17:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:17:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:17:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-06 04:17:00,620 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-06 04:17:00,620 INFO L175 Difference]: Start difference. First operand has 58 places, 65 transitions, 611 flow. Second operand 5 states and 67 transitions. [2022-12-06 04:17:00,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 1660 flow [2022-12-06 04:17:00,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 142 transitions, 1569 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-12-06 04:17:00,630 INFO L231 Difference]: Finished difference. Result has 63 places, 71 transitions, 655 flow [2022-12-06 04:17:00,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=63, PETRI_TRANSITIONS=71} [2022-12-06 04:17:00,630 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 28 predicate places. [2022-12-06 04:17:00,630 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:00,631 INFO L89 Accepts]: Start accepts. Operand has 63 places, 71 transitions, 655 flow [2022-12-06 04:17:00,632 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:00,632 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:00,632 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 71 transitions, 655 flow [2022-12-06 04:17:00,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 71 transitions, 655 flow [2022-12-06 04:17:00,686 INFO L130 PetriNetUnfolder]: 185/417 cut-off events. [2022-12-06 04:17:00,686 INFO L131 PetriNetUnfolder]: For 2029/2104 co-relation queries the response was YES. [2022-12-06 04:17:00,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 417 events. 185/417 cut-off events. For 2029/2104 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2439 event pairs, 54 based on Foata normal form. 35/427 useless extension candidates. Maximal degree in co-relation 1819. Up to 179 conditions per place. [2022-12-06 04:17:00,690 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 71 transitions, 655 flow [2022-12-06 04:17:00,690 INFO L188 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-06 04:17:00,692 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_73) 1 0) 0) 0 1) v_~main$tmp_guard0~0_30)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [402] L773-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#res.offset_7| 0) (= |v_P1Thread1of1ForFork0_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] [2022-12-06 04:17:00,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [405] L830-3-->L834: Formula: (and (= (mod v_~main$tmp_guard0~0_30 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|) (= (ite (= (ite (= 3 v_~__unbuffered_cnt~0_73) 1 0) 0) 0 1) v_~main$tmp_guard0~0_30)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_11|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [399] L751-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P0Thread1of1ForFork2_#res.offset_9| 0) (= |v_P0Thread1of1ForFork2_#res.base_9| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_9|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] [2022-12-06 04:17:01,241 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:17:01,241 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 611 [2022-12-06 04:17:01,241 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 71 transitions, 684 flow [2022-12-06 04:17:01,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:01,242 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:01,242 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:01,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 04:17:01,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:17:01,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:01,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1345259092, now seen corresponding path program 1 times [2022-12-06 04:17:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:01,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317099968] [2022-12-06 04:17:01,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:01,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317099968] [2022-12-06 04:17:01,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317099968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:01,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:01,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:17:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369684489] [2022-12-06 04:17:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:01,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:17:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:01,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:17:01,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:17:01,361 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-06 04:17:01,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 71 transitions, 684 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:01,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:01,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-06 04:17:01,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:01,532 INFO L130 PetriNetUnfolder]: 382/723 cut-off events. [2022-12-06 04:17:01,532 INFO L131 PetriNetUnfolder]: For 4276/4357 co-relation queries the response was YES. [2022-12-06 04:17:01,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 723 events. 382/723 cut-off events. For 4276/4357 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3806 event pairs, 57 based on Foata normal form. 107/808 useless extension candidates. Maximal degree in co-relation 3447. Up to 303 conditions per place. [2022-12-06 04:17:01,539 INFO L137 encePairwiseOnDemand]: 16/24 looper letters, 86 selfloop transitions, 13 changer transitions 13/121 dead transitions. [2022-12-06 04:17:01,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 121 transitions, 1319 flow [2022-12-06 04:17:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:01,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2022-12-06 04:17:01,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 04:17:01,540 INFO L175 Difference]: Start difference. First operand has 63 places, 71 transitions, 684 flow. Second operand 6 states and 81 transitions. [2022-12-06 04:17:01,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 121 transitions, 1319 flow [2022-12-06 04:17:01,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 1226 flow, removed 21 selfloop flow, removed 5 redundant places. [2022-12-06 04:17:01,547 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 498 flow [2022-12-06 04:17:01,547 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2022-12-06 04:17:01,548 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-06 04:17:01,548 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:01,548 INFO L89 Accepts]: Start accepts. Operand has 65 places, 56 transitions, 498 flow [2022-12-06 04:17:01,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:01,549 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:01,549 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 56 transitions, 498 flow [2022-12-06 04:17:01,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 56 transitions, 498 flow [2022-12-06 04:17:01,572 INFO L130 PetriNetUnfolder]: 84/262 cut-off events. [2022-12-06 04:17:01,572 INFO L131 PetriNetUnfolder]: For 1349/1401 co-relation queries the response was YES. [2022-12-06 04:17:01,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 262 events. 84/262 cut-off events. For 1349/1401 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1570 event pairs, 15 based on Foata normal form. 5/256 useless extension candidates. Maximal degree in co-relation 1223. Up to 153 conditions per place. [2022-12-06 04:17:01,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 56 transitions, 498 flow [2022-12-06 04:17:01,575 INFO L188 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-06 04:17:01,673 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [451] $Ultimate##0-->L798: Formula: (and (= v_~y$r_buff0_thd0~0_275 v_~y$r_buff1_thd0~0_270) (= 2 v_~y$w_buff0~0_276) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= |v_P2Thread1of1ForFork1_~arg#1.base_40| |v_P2Thread1of1ForFork1_#in~arg#1.base_40|) (= v_~y$w_buff0_used~0_425 1) (= v_~z~0_51 1) (= v_~y$w_buff0_used~0_426 v_~y$w_buff1_used~0_386) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_40| |v_P2Thread1of1ForFork1_~arg#1.offset_40|) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_89) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= v_~y$r_buff0_thd2~0_118 v_~y$r_buff1_thd2~0_119) (= v_~y$r_buff0_thd3~0_153 v_~y$r_buff1_thd3~0_114) (= v_~y$w_buff1~0_241 v_~y$w_buff0~0_277) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_425 256) 0)) (not (= (mod v_~y$w_buff1_used~0_386 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$r_buff0_thd3~0_152 1)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_426, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_153, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_277, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_40|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff1~0=v_~y$w_buff1~0_241, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_276, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~z~0=v_~z~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_386} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [322] L748-->L751: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] [2022-12-06 04:17:01,768 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L763-->L766: Formula: (= v_~y~0_1 1) InVars {} OutVars{~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] and [451] $Ultimate##0-->L798: Formula: (and (= v_~y$r_buff0_thd0~0_275 v_~y$r_buff1_thd0~0_270) (= 2 v_~y$w_buff0~0_276) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= |v_P2Thread1of1ForFork1_~arg#1.base_40| |v_P2Thread1of1ForFork1_#in~arg#1.base_40|) (= v_~y$w_buff0_used~0_425 1) (= v_~z~0_51 1) (= v_~y$w_buff0_used~0_426 v_~y$w_buff1_used~0_386) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42| 0)) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_40| |v_P2Thread1of1ForFork1_~arg#1.offset_40|) (= v_~z~0_51 v_~__unbuffered_p2_EAX~0_89) (= v_~y$r_buff0_thd1~0_54 v_~y$r_buff1_thd1~0_48) (= v_~y$r_buff0_thd2~0_118 v_~y$r_buff1_thd2~0_119) (= v_~y$r_buff0_thd3~0_153 v_~y$r_buff1_thd3~0_114) (= v_~y$w_buff1~0_241 v_~y$w_buff0~0_277) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_425 256) 0)) (not (= (mod v_~y$w_buff1_used~0_386 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|) (= v_~y$r_buff0_thd3~0_152 1)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_426, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_153, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_277, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_425, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_40|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_40|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_119, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_48, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_114, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_40|, ~y$w_buff1~0=v_~y$w_buff1~0_241, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_275, ~y$w_buff0~0=v_~y$w_buff0~0_276, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_40|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_118, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_89, ~z~0=v_~z~0_51, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_270, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_42|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_386} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:17:01,914 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:17:01,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 367 [2022-12-06 04:17:01,915 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 508 flow [2022-12-06 04:17:01,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:01,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:01,915 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 04:17:01,915 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:17:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:01,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1419441439, now seen corresponding path program 1 times [2022-12-06 04:17:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606404166] [2022-12-06 04:17:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:01,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:02,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606404166] [2022-12-06 04:17:02,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606404166] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:02,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:02,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 04:17:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190684609] [2022-12-06 04:17:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:02,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:17:02,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:17:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:17:02,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 04:17:02,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 508 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:02,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:02,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 04:17:02,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:02,437 INFO L130 PetriNetUnfolder]: 708/1242 cut-off events. [2022-12-06 04:17:02,437 INFO L131 PetriNetUnfolder]: For 6466/6466 co-relation queries the response was YES. [2022-12-06 04:17:02,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6276 conditions, 1242 events. 708/1242 cut-off events. For 6466/6466 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6413 event pairs, 79 based on Foata normal form. 9/1237 useless extension candidates. Maximal degree in co-relation 6244. Up to 681 conditions per place. [2022-12-06 04:17:02,451 INFO L137 encePairwiseOnDemand]: 17/27 looper letters, 69 selfloop transitions, 9 changer transitions 65/143 dead transitions. [2022-12-06 04:17:02,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1562 flow [2022-12-06 04:17:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:17:02,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:17:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-06 04:17:02,452 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2022-12-06 04:17:02,453 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 508 flow. Second operand 6 states and 76 transitions. [2022-12-06 04:17:02,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1562 flow [2022-12-06 04:17:02,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 143 transitions, 1448 flow, removed 50 selfloop flow, removed 1 redundant places. [2022-12-06 04:17:02,470 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 420 flow [2022-12-06 04:17:02,470 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2022-12-06 04:17:02,470 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 36 predicate places. [2022-12-06 04:17:02,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:02,470 INFO L89 Accepts]: Start accepts. Operand has 71 places, 47 transitions, 420 flow [2022-12-06 04:17:02,473 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:02,473 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:02,473 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 47 transitions, 420 flow [2022-12-06 04:17:02,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 47 transitions, 420 flow [2022-12-06 04:17:02,496 INFO L130 PetriNetUnfolder]: 83/230 cut-off events. [2022-12-06 04:17:02,496 INFO L131 PetriNetUnfolder]: For 1330/1346 co-relation queries the response was YES. [2022-12-06 04:17:02,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 230 events. 83/230 cut-off events. For 1330/1346 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1144 event pairs, 14 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 1042. Up to 71 conditions per place. [2022-12-06 04:17:02,499 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 47 transitions, 420 flow [2022-12-06 04:17:02,499 INFO L188 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-06 04:17:02,512 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [452] $Ultimate##0-->L766: Formula: (and (= v_~y$w_buff1~0_247 v_~y$w_buff0~0_285) (= v_~z~0_53 v_~__unbuffered_p2_EAX~0_91) (= v_~y$r_buff0_thd0~0_285 v_~y$r_buff1_thd0~0_280) (= v_~y$w_buff0_used~0_441 1) (= v_~y$r_buff0_thd3~0_156 1) (= v_~y$r_buff0_thd3~0_157 v_~y$r_buff1_thd3~0_116) (= v_~y$r_buff0_thd2~0_128 v_~y$r_buff1_thd2~0_129) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_42| |v_P2Thread1of1ForFork1_~arg#1.offset_42|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (= 2 v_~y$w_buff0~0_284) (= |v_P2Thread1of1ForFork1_~arg#1.base_42| |v_P2Thread1of1ForFork1_#in~arg#1.base_42|) (= v_~z~0_53 1) (= v_~y$r_buff0_thd1~0_56 v_~y$r_buff1_thd1~0_50) (= v_~y$w_buff0_used~0_442 v_~y$w_buff1_used~0_400) (= v_~y~0_346 1) (= (ite (not (and (not (= (mod v_~y$w_buff0_used~0_441 256) 0)) (not (= (mod v_~y$w_buff1_used~0_400 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44| 0))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_442, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_157, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_285, ~y$w_buff0~0=v_~y$w_buff0~0_285, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_42|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_441, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_42|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_42|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_129, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_116, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_42|, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_156, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_285, ~y$w_buff0~0=v_~y$w_buff0~0_284, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_42|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_128, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_56, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_44|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_91, ~z~0=v_~z~0_53, ~y~0=v_~y~0_346, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_280, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_44|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_400} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] and [338] L798-->L801: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-06 04:17:02,860 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [356] $Ultimate##0-->L748: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_~a~0_6 1) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{~a~0=v_~a~0_6, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_5, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_~arg.base] and [458] $Ultimate##0-->L751: Formula: (and (= v_~y$r_buff0_thd0~0_301 v_~y$r_buff1_thd0~0_296) (= v_~y$w_buff0_used~0_462 v_~y$w_buff1_used~0_416) (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_416 256) 0)) (not (= (mod v_~y$w_buff0_used~0_461 256) 0)))) 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~z~0_57 1) (= 2 v_~y$w_buff0~0_300) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|) (= v_~y$r_buff0_thd3~0_165 v_~y$r_buff1_thd3~0_120) (= v_~x~0_39 v_~__unbuffered_p0_EAX~0_99) (= v_~y$w_buff0_used~0_461 1) (= v_~z~0_57 v_~__unbuffered_p2_EAX~0_99) (= |v_P2Thread1of1ForFork1_~arg#1.base_46| |v_P2Thread1of1ForFork1_#in~arg#1.base_46|) (= v_~y$r_buff0_thd1~0_60 v_~y$r_buff1_thd1~0_54) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_46| |v_P2Thread1of1ForFork1_~arg#1.offset_46|) (= v_~y$r_buff0_thd3~0_164 1) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48| 0)) (= v_~y$r_buff0_thd2~0_132 v_~y$r_buff1_thd2~0_133) (= v_~y$w_buff1~0_259 v_~y$w_buff0~0_301)) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_46|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_462, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_165, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_301, ~y$w_buff0~0=v_~y$w_buff0~0_301, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_132, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_46|, ~x~0=v_~x~0_39} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_461, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_46|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_46|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_133, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_120, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_46|, ~y$w_buff1~0=v_~y$w_buff1~0_259, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_164, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_301, ~y$w_buff0~0=v_~y$w_buff0~0_300, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_132, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_60, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_99, ~z~0=v_~z~0_57, ~x~0=v_~x~0_39, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_296, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_48|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_416} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$r_buff0_thd3~0, ~y$w_buff0~0, P2Thread1of1ForFork1_~arg#1.base, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1_used~0] [2022-12-06 04:17:03,070 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:17:03,071 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 601 [2022-12-06 04:17:03,071 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 45 transitions, 426 flow [2022-12-06 04:17:03,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:03,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:17:03,072 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:17:03,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 04:17:03,072 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:17:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:17:03,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1215112017, now seen corresponding path program 2 times [2022-12-06 04:17:03,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:17:03,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202547700] [2022-12-06 04:17:03,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:17:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:17:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:17:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:17:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:17:03,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202547700] [2022-12-06 04:17:03,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202547700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:17:03,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:17:03,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 04:17:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084094802] [2022-12-06 04:17:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:17:03,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:17:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:17:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:17:03,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:17:03,217 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 04:17:03,217 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 45 transitions, 426 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:17:03,217 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:17:03,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 04:17:03,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:17:03,343 INFO L130 PetriNetUnfolder]: 189/387 cut-off events. [2022-12-06 04:17:03,343 INFO L131 PetriNetUnfolder]: For 2107/2125 co-relation queries the response was YES. [2022-12-06 04:17:03,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 387 events. 189/387 cut-off events. For 2107/2125 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1877 event pairs, 23 based on Foata normal form. 43/421 useless extension candidates. Maximal degree in co-relation 1778. Up to 130 conditions per place. [2022-12-06 04:17:03,346 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 50 selfloop transitions, 11 changer transitions 14/79 dead transitions. [2022-12-06 04:17:03,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 79 transitions, 817 flow [2022-12-06 04:17:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 04:17:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 04:17:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-06 04:17:03,347 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2022-12-06 04:17:03,347 INFO L175 Difference]: Start difference. First operand has 65 places, 45 transitions, 426 flow. Second operand 7 states and 76 transitions. [2022-12-06 04:17:03,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 79 transitions, 817 flow [2022-12-06 04:17:03,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 707 flow, removed 36 selfloop flow, removed 9 redundant places. [2022-12-06 04:17:03,351 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 330 flow [2022-12-06 04:17:03,352 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=330, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2022-12-06 04:17:03,352 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2022-12-06 04:17:03,352 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:17:03,352 INFO L89 Accepts]: Start accepts. Operand has 65 places, 42 transitions, 330 flow [2022-12-06 04:17:03,353 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:17:03,353 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:17:03,353 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 42 transitions, 330 flow [2022-12-06 04:17:03,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 42 transitions, 330 flow [2022-12-06 04:17:03,364 INFO L130 PetriNetUnfolder]: 30/111 cut-off events. [2022-12-06 04:17:03,365 INFO L131 PetriNetUnfolder]: For 243/249 co-relation queries the response was YES. [2022-12-06 04:17:03,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 111 events. 30/111 cut-off events. For 243/249 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 460 event pairs, 1 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 446. Up to 35 conditions per place. [2022-12-06 04:17:03,366 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 42 transitions, 330 flow [2022-12-06 04:17:03,366 INFO L188 LiptonReduction]: Number of co-enabled transitions 196 [2022-12-06 04:17:04,000 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [462] $Ultimate##0-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_477 256) 0))) (.cse2 (not (= (mod v_~y$r_buff0_thd2~0_143 256) 0))) (.cse4 (= (mod v_~y$w_buff0_used~0_479 256) 0))) (let ((.cse0 (and .cse2 (not .cse4))) (.cse1 (and .cse3 .cse2))) (and (= v_~y$r_buff0_thd1~0_66 v_~y$r_buff1_thd1~0_60) (= v_~z~0_63 1) (= v_~y$r_buff0_thd3~0_176 1) (= v_~y$w_buff1_used~0_426 (ite (or .cse0 .cse1) 0 v_~y$w_buff0_used~0_479)) (= v_~y$w_buff1~0_267 v_~y$w_buff0~0_315) (= v_~z~0_63 v_~__unbuffered_p2_EAX~0_105) (= |v_P2Thread1of1ForFork1_~arg#1.base_52| |v_P2Thread1of1ForFork1_#in~arg#1.base_52|) (not (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| 0)) (= 2 v_~y$w_buff0~0_314) (= |v_P2Thread1of1ForFork1_#in~arg#1.offset_52| |v_P2Thread1of1ForFork1_~arg#1.offset_52|) (= |v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54| |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|) (= v_~y$w_buff0_used~0_477 (ite .cse2 0 1)) (= v_~y$r_buff0_thd3~0_177 v_~y$r_buff1_thd3~0_126) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd2~0_142 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_426 256) 0)) .cse2)) 0 v_~y$r_buff0_thd2~0_143) v_~y$r_buff1_thd2~0_143) (= v_~y$r_buff0_thd0~0_307 v_~y$r_buff1_thd0~0_302) (= v_~y~0_368 (ite .cse2 v_~y$w_buff0~0_314 (ite .cse0 v_~y$w_buff1~0_267 1))) (= (ite .cse1 0 v_~y$r_buff0_thd2~0_143) v_~y$r_buff0_thd2~0_142) (= (ite .cse4 1 0) |v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|)))) InVars {P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_52|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_479, ~y$w_buff0~0=v_~y$w_buff0~0_315, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_177, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_143, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_52|} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_477, P2Thread1of1ForFork1_~arg#1.offset=|v_P2Thread1of1ForFork1_~arg#1.offset_52|, P2Thread1of1ForFork1_#in~arg#1.offset=|v_P2Thread1of1ForFork1_#in~arg#1.offset_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_143, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_60, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_126, P2Thread1of1ForFork1_#in~arg#1.base=|v_P2Thread1of1ForFork1_#in~arg#1.base_52|, ~y$w_buff1~0=v_~y$w_buff1~0_267, ~y$w_buff0~0=v_~y$w_buff0~0_314, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_176, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_307, P2Thread1of1ForFork1_~arg#1.base=|v_P2Thread1of1ForFork1_~arg#1.base_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_66, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_~expression#1_54|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_105, ~z~0=v_~z~0_63, ~y~0=v_~y~0_368, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_302, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_426, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_54|} AuxVars[] AssignedVars[~y$w_buff0_used~0, P2Thread1of1ForFork1_~arg#1.offset, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd3~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_~arg#1.base, ~y$r_buff0_thd2~0, P2Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, P2Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [338] L798-->L801: Formula: (= v_~__unbuffered_p2_EBX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~a~0=v_~a~0_2, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EBX~0] [2022-12-06 04:20:49,204 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 2940 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 04:22:50,962 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 04:22:50,963 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 347611 [2022-12-06 04:22:50,963 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 329 flow [2022-12-06 04:22:50,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:50,963 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:50,963 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:50,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 04:22:50,963 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:22:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1224476998, now seen corresponding path program 1 times [2022-12-06 04:22:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877679019] [2022-12-06 04:22:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:50,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:51,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:51,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877679019] [2022-12-06 04:22:51,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877679019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:51,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:51,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:22:51,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239437382] [2022-12-06 04:22:51,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:51,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:22:51,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:51,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:22:51,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:22:51,080 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 23 [2022-12-06 04:22:51,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 329 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:51,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:51,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 23 [2022-12-06 04:22:51,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:51,150 INFO L130 PetriNetUnfolder]: 113/235 cut-off events. [2022-12-06 04:22:51,150 INFO L131 PetriNetUnfolder]: For 1022/1028 co-relation queries the response was YES. [2022-12-06 04:22:51,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1192 conditions, 235 events. 113/235 cut-off events. For 1022/1028 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1001 event pairs, 5 based on Foata normal form. 1/234 useless extension candidates. Maximal degree in co-relation 1160. Up to 118 conditions per place. [2022-12-06 04:22:51,152 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 27 selfloop transitions, 1 changer transitions 38/68 dead transitions. [2022-12-06 04:22:51,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 700 flow [2022-12-06 04:22:51,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:22:51,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:22:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 04:22:51,153 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-06 04:22:51,153 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 329 flow. Second operand 4 states and 44 transitions. [2022-12-06 04:22:51,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 700 flow [2022-12-06 04:22:51,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 589 flow, removed 32 selfloop flow, removed 11 redundant places. [2022-12-06 04:22:51,156 INFO L231 Difference]: Finished difference. Result has 53 places, 26 transitions, 159 flow [2022-12-06 04:22:51,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=53, PETRI_TRANSITIONS=26} [2022-12-06 04:22:51,156 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2022-12-06 04:22:51,156 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:51,157 INFO L89 Accepts]: Start accepts. Operand has 53 places, 26 transitions, 159 flow [2022-12-06 04:22:51,159 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:51,159 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:51,159 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 26 transitions, 159 flow [2022-12-06 04:22:51,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 26 transitions, 159 flow [2022-12-06 04:22:51,164 INFO L130 PetriNetUnfolder]: 11/46 cut-off events. [2022-12-06 04:22:51,164 INFO L131 PetriNetUnfolder]: For 86/96 co-relation queries the response was YES. [2022-12-06 04:22:51,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 46 events. 11/46 cut-off events. For 86/96 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 0 based on Foata normal form. 5/50 useless extension candidates. Maximal degree in co-relation 143. Up to 12 conditions per place. [2022-12-06 04:22:51,164 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 26 transitions, 159 flow [2022-12-06 04:22:51,165 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 04:22:51,213 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [471] $Ultimate##0-->L766: Formula: (and (= v_~y~0_392 1) (= v_~x~0_48 1) (= |v_P1Thread1of1ForFork0_#in~arg.offset_15| v_P1Thread1of1ForFork0_~arg.offset_15) (= v_P1Thread1of1ForFork0_~arg.base_15 |v_P1Thread1of1ForFork0_#in~arg.base_15|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_15, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_15|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_15|, ~y~0=v_~y~0_392, ~x~0=v_~x~0_48} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~y~0, ~x~0] and [339] L801-->L808: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_77 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_19 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd3~0_16 256) 0)))) (let ((.cse1 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_69 256) 0)))) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_78 256) 0)) .cse5)) (.cse2 (and .cse3 .cse5))) (and (= (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_27 v_~y~0_44)) v_~y~0_43) (= v_~y$w_buff1_used~0_68 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_69)) (= (ite .cse0 0 v_~y$w_buff0_used~0_78) v_~y$w_buff0_used~0_77) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd3~0_18 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_68 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_16) v_~y$r_buff1_thd3~0_15) (= v_~y$r_buff0_thd3~0_18 (ite .cse2 0 v_~y$r_buff0_thd3~0_19))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_78, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_19, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_44, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_69} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_77, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y~0=v_~y~0_43, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_68} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:22:51,461 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [473] $Ultimate##0-->L808: Formula: (let ((.cse3 (not (= 0 (mod v_~y$w_buff0_used~0_515 256)))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_199 256) 0))) (.cse2 (not (= (mod v_~y$r_buff1_thd3~0_139 256) 0)))) (let ((.cse0 (and (not (= 0 (mod v_~y$w_buff1_used~0_455 256))) .cse2)) (.cse1 (and .cse3 .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_516 256) 0)) .cse5))) (and (= v_~y$w_buff1_used~0_454 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_455)) (= (ite (or (and .cse2 (not (= (mod v_~y$w_buff1_used~0_454 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_198 256) 0)) .cse3)) 0 v_~y$r_buff1_thd3~0_139) v_~y$r_buff1_thd3~0_138) (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_19|) (= |v_P1Thread1of1ForFork0_#in~arg.offset_19| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~y~0_396 (ite .cse4 v_~y$w_buff0~0_344 (ite .cse0 v_~y$w_buff1~0_287 1))) (= v_~y$r_buff0_thd3~0_198 (ite .cse1 0 v_~y$r_buff0_thd3~0_199)) (= (ite .cse4 0 v_~y$w_buff0_used~0_516) v_~y$w_buff0_used~0_515) (= v_~x~0_52 1)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_139, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_516, ~y$w_buff1~0=v_~y$w_buff1~0_287, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_199, ~y$w_buff0~0=v_~y$w_buff0~0_344, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_19|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_19|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_455} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_138, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_515, ~y$w_buff1~0=v_~y$w_buff1~0_287, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_198, ~y$w_buff0~0=v_~y$w_buff0~0_344, 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_396, ~x~0=v_~x~0_52, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_454} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P1Thread1of1ForFork0_~arg.offset, ~y$w_buff0_used~0, P1Thread1of1ForFork0_~arg.base, ~y$r_buff0_thd3~0, ~y~0, ~x~0, ~y$w_buff1_used~0] and [329] L766-->L773: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_26 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_105 256) 0)))) (let ((.cse0 (and .cse5 .cse2)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_106 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_93 256) 0)) .cse3))) (and (= v_~y$r_buff0_thd2~0_25 (ite .cse0 0 v_~y$r_buff0_thd2~0_26)) (= v_~y$w_buff0_used~0_105 (ite .cse1 0 v_~y$w_buff0_used~0_106)) (= (ite (or (and .cse2 (not (= (mod v_~y$r_buff0_thd2~0_25 256) 0))) (and .cse3 (not (= (mod v_~y$w_buff1_used~0_92 256) 0)))) 0 v_~y$r_buff1_thd2~0_20) v_~y$r_buff1_thd2~0_19) (= (ite (or .cse4 .cse0) 0 v_~y$w_buff1_used~0_93) v_~y$w_buff1_used~0_92) (= v_~y~0_61 (ite .cse1 v_~y$w_buff0~0_44 (ite .cse4 v_~y$w_buff1~0_41 v_~y~0_62)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_26, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, ~y$w_buff1~0=v_~y$w_buff1~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_44, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_25, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_92} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0] [2022-12-06 04:22:51,634 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:22:51,635 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 479 [2022-12-06 04:22:51,635 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 165 flow [2022-12-06 04:22:51,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:51,635 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:51,636 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:51,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 04:22:51,636 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:22:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:51,636 INFO L85 PathProgramCache]: Analyzing trace with hash 466472213, now seen corresponding path program 1 times [2022-12-06 04:22:51,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:51,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144196628] [2022-12-06 04:22:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:22:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:22:52,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:22:52,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144196628] [2022-12-06 04:22:52,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144196628] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:22:52,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:22:52,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:22:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488718540] [2022-12-06 04:22:52,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:22:52,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:22:52,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:22:52,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:22:52,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:22:52,052 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 04:22:52,052 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 165 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:52,052 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:22:52,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 04:22:52,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:22:52,132 INFO L130 PetriNetUnfolder]: 27/73 cut-off events. [2022-12-06 04:22:52,132 INFO L131 PetriNetUnfolder]: For 368/368 co-relation queries the response was YES. [2022-12-06 04:22:52,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 73 events. 27/73 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 226 event pairs, 3 based on Foata normal form. 1/74 useless extension candidates. Maximal degree in co-relation 344. Up to 38 conditions per place. [2022-12-06 04:22:52,133 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 19 selfloop transitions, 2 changer transitions 16/37 dead transitions. [2022-12-06 04:22:52,133 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 37 transitions, 320 flow [2022-12-06 04:22:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:22:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:22:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-12-06 04:22:52,134 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2823529411764706 [2022-12-06 04:22:52,134 INFO L175 Difference]: Start difference. First operand has 44 places, 23 transitions, 165 flow. Second operand 5 states and 24 transitions. [2022-12-06 04:22:52,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 37 transitions, 320 flow [2022-12-06 04:22:52,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 276 flow, removed 13 selfloop flow, removed 9 redundant places. [2022-12-06 04:22:52,135 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 119 flow [2022-12-06 04:22:52,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2022-12-06 04:22:52,136 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 04:22:52,136 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:22:52,136 INFO L89 Accepts]: Start accepts. Operand has 40 places, 21 transitions, 119 flow [2022-12-06 04:22:52,137 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:22:52,137 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:22:52,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 21 transitions, 119 flow [2022-12-06 04:22:52,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 21 transitions, 119 flow [2022-12-06 04:22:52,142 INFO L130 PetriNetUnfolder]: 9/35 cut-off events. [2022-12-06 04:22:52,142 INFO L131 PetriNetUnfolder]: For 39/39 co-relation queries the response was YES. [2022-12-06 04:22:52,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 35 events. 9/35 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 78 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 101. Up to 12 conditions per place. [2022-12-06 04:22:52,142 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 21 transitions, 119 flow [2022-12-06 04:22:52,142 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 04:22:52,176 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:22:52,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 41 [2022-12-06 04:22:52,177 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 21 transitions, 123 flow [2022-12-06 04:22:52,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:22:52,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:22:52,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:52,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 04:22:52,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 04:22:52,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:22:52,178 INFO L85 PathProgramCache]: Analyzing trace with hash -705210165, now seen corresponding path program 1 times [2022-12-06 04:22:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:22:52,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511728930] [2022-12-06 04:22:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:22:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:22:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:22:52,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:22:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:22:52,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:22:52,293 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:22:52,293 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 04:22:52,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 04:22:52,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 04:22:52,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 04:22:52,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 04:22:52,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 04:22:52,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 04:22:52,295 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:22:52,303 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:22:52,304 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:22:52,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:22:52 BasicIcfg [2022-12-06 04:22:52,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:22:52,342 INFO L158 Benchmark]: Toolchain (without parser) took 363405.43ms. Allocated memory was 194.0MB in the beginning and 902.8MB in the end (delta: 708.8MB). Free memory was 169.0MB in the beginning and 468.2MB in the end (delta: -299.2MB). Peak memory consumption was 411.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,342 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:22:52,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.60ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 142.2MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.33ms. Allocated memory is still 194.0MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,343 INFO L158 Benchmark]: Boogie Preprocessor took 24.20ms. Allocated memory is still 194.0MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,343 INFO L158 Benchmark]: RCFGBuilder took 587.07ms. Allocated memory is still 194.0MB. Free memory was 138.0MB in the beginning and 105.0MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,345 INFO L158 Benchmark]: TraceAbstraction took 362289.77ms. Allocated memory was 194.0MB in the beginning and 902.8MB in the end (delta: 708.8MB). Free memory was 104.5MB in the beginning and 468.2MB in the end (delta: -363.8MB). Peak memory consumption was 346.1MB. Max. memory is 8.0GB. [2022-12-06 04:22:52,346 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.11ms. Allocated memory is still 194.0MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.60ms. Allocated memory is still 194.0MB. Free memory was 169.0MB in the beginning and 142.2MB in the end (delta: 26.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.33ms. Allocated memory is still 194.0MB. Free memory was 142.2MB in the beginning and 139.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.20ms. Allocated memory is still 194.0MB. Free memory was 139.6MB in the beginning and 138.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.07ms. Allocated memory is still 194.0MB. Free memory was 138.0MB in the beginning and 105.0MB in the end (delta: 33.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 362289.77ms. Allocated memory was 194.0MB in the beginning and 902.8MB in the end (delta: 708.8MB). Free memory was 104.5MB in the beginning and 468.2MB in the end (delta: -363.8MB). Peak memory consumption was 346.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 116 PlacesBefore, 35 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 1944 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1635, independent: 1580, independent conditional: 1580, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1635, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1635, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1635, independent: 1580, independent conditional: 0, independent unconditional: 1580, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1240, independent: 1198, independent conditional: 0, independent unconditional: 1198, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1240, independent: 1185, independent conditional: 0, independent unconditional: 1185, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 202, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1635, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1240, unknown conditional: 0, unknown unconditional: 1240] , Statistics on independence cache: Total cache size (in pairs): 1963, Positive cache size: 1921, Positive conditional cache size: 0, Positive unconditional cache size: 1921, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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, 30 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 73, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 73, independent conditional: 3, independent unconditional: 70, dependent: 22, dependent conditional: 3, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 86, independent: 67, independent conditional: 3, independent unconditional: 64, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 86, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 77, dependent conditional: 14, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 86, unknown conditional: 6, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 67, Positive conditional cache size: 3, Positive unconditional cache size: 64, Negative cache size: 19, Negative conditional cache size: 3, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 202 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 154, independent conditional: 154, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 191, independent: 154, independent conditional: 12, independent unconditional: 142, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 191, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 191, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 191, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 88, Positive conditional cache size: 3, Positive unconditional cache size: 85, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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.0s, 35 PlacesBefore, 35 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 52, independent conditional: 52, 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: 70, independent: 52, independent conditional: 10, independent unconditional: 42, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 52, independent conditional: 6, independent unconditional: 46, 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: 70, independent: 52, independent conditional: 6, independent unconditional: 46, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 40, independent conditional: 2, independent unconditional: 38, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 100, Positive conditional cache size: 7, Positive unconditional cache size: 93, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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.1s, 43 PlacesBefore, 43 PlacesAfterwards, 47 TransitionsBefore, 47 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 230, independent: 186, independent conditional: 186, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 230, independent: 186, independent conditional: 88, independent unconditional: 98, dependent: 44, dependent conditional: 22, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 230, independent: 186, independent conditional: 60, independent unconditional: 126, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 230, independent: 186, independent conditional: 60, independent unconditional: 126, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 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: 230, independent: 181, independent conditional: 55, independent unconditional: 126, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 107, Positive conditional cache size: 12, Positive unconditional cache size: 95, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 338 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 129, independent: 110, independent conditional: 110, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 129, independent: 110, independent conditional: 20, independent unconditional: 90, dependent: 19, dependent conditional: 3, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 129, independent: 110, independent conditional: 17, independent unconditional: 93, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 129, independent: 110, independent conditional: 17, independent unconditional: 93, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ 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] ], Cache Queries: [ total: 129, independent: 104, independent conditional: 17, independent unconditional: 87, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 113, Positive conditional cache size: 12, Positive unconditional cache size: 101, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 49 PlacesBefore, 49 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 331, independent: 279, independent conditional: 279, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 331, independent: 279, independent conditional: 30, independent unconditional: 249, dependent: 52, dependent conditional: 6, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 331, independent: 279, independent conditional: 24, independent unconditional: 255, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 331, independent: 279, independent conditional: 24, independent unconditional: 255, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 331, independent: 275, independent conditional: 24, independent unconditional: 251, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 122, Positive conditional cache size: 12, Positive unconditional cache size: 110, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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.0s, 53 PlacesBefore, 53 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 32, dependent conditional: 32, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 19, independent unconditional: 162, dependent: 32, dependent conditional: 3, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 213, independent: 181, independent conditional: 16, independent unconditional: 165, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 213, independent: 181, independent conditional: 16, independent unconditional: 165, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 213, independent: 181, independent conditional: 16, independent unconditional: 165, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 122, Positive conditional cache size: 12, Positive unconditional cache size: 110, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 247, independent: 213, independent conditional: 213, 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: 247, independent: 213, independent conditional: 27, independent unconditional: 186, dependent: 34, dependent conditional: 3, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 247, independent: 213, independent conditional: 24, independent unconditional: 189, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 247, independent: 213, independent conditional: 24, independent unconditional: 189, dependent: 34, dependent conditional: 0, dependent unconditional: 34, 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: 247, independent: 213, independent conditional: 24, independent unconditional: 189, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 122, Positive conditional cache size: 12, Positive unconditional cache size: 110, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 63 PlacesBefore, 63 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 187, independent: 165, independent conditional: 165, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 187, independent: 165, independent conditional: 102, independent unconditional: 63, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 187, independent: 165, independent conditional: 88, independent unconditional: 77, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 187, independent: 165, independent conditional: 88, independent unconditional: 77, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, 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: 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: 187, independent: 160, independent conditional: 83, independent unconditional: 77, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 142, Positive conditional cache size: 18, Positive unconditional cache size: 124, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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, 65 PlacesBefore, 64 PlacesAfterwards, 56 TransitionsBefore, 55 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 40, independent unconditional: 40, dependent: 16, dependent conditional: 6, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, independent: 80, independent conditional: 26, independent unconditional: 54, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, independent: 76, independent conditional: 22, independent unconditional: 54, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 190, Positive cache size: 166, Positive conditional cache size: 22, Positive unconditional cache size: 144, Negative cache size: 24, Negative conditional cache size: 3, Negative unconditional cache size: 21, 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.6s, 67 PlacesBefore, 65 PlacesAfterwards, 47 TransitionsBefore, 45 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 54, independent: 43, independent conditional: 43, 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: 54, independent: 43, independent conditional: 26, independent unconditional: 17, 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: 54, independent: 43, independent conditional: 16, independent unconditional: 27, 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: 54, independent: 43, independent conditional: 16, independent unconditional: 27, 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: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 54, independent: 42, independent conditional: 15, independent unconditional: 27, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 201, Positive cache size: 177, Positive conditional cache size: 23, Positive unconditional cache size: 154, Negative cache size: 24, Negative conditional cache size: 3, 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: 347.6s, 63 PlacesBefore, 59 PlacesAfterwards, 42 TransitionsBefore, 38 TransitionsAfterwards, 196 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 141, independent conditional: 141, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 153, independent: 141, independent conditional: 105, independent unconditional: 36, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 153, independent: 141, independent conditional: 104, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 153, independent: 141, independent conditional: 104, independent unconditional: 37, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 153, independent: 129, independent conditional: 94, independent unconditional: 35, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 13, unknown conditional: 10, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 215, Positive conditional cache size: 34, Positive unconditional cache size: 181, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 47 PlacesBefore, 44 PlacesAfterwards, 26 TransitionsBefore, 23 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 26, independent conditional: 26, 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: 26, independent: 26, independent conditional: 22, independent unconditional: 4, 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: 26, independent: 26, independent conditional: 20, independent unconditional: 6, 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: 26, independent: 26, independent conditional: 20, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 24, independent conditional: 18, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 257, Positive conditional cache size: 36, Positive unconditional cache size: 221, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 12 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, 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: 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: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 296, Positive cache size: 271, Positive conditional cache size: 37, Positive unconditional cache size: 234, Negative cache size: 25, Negative conditional cache size: 3, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1108, ((void *)0), P0, ((void *)0))=-2, t1108={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1109, ((void *)0), P1, ((void *)0))=-1, t1108={5:0}, t1109={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1110, ((void *)0), P2, ((void *)0))=0, t1108={5:0}, t1109={6:0}, t1110={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L786] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 1 [L765] 2 y = 1 [L803] 2 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] 2 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] 2 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L848] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L849] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L850] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L851] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L853] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 826]: 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: 828]: 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: 830]: 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, 139 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: 362.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1082 IncrementalHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 18 mSDtfsCounter, 1082 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=684occurred in iteration=9, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 151 ConstructedInterpolants, 0 QuantifiedInterpolants, 1615 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 04:22:52,381 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...