/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:39:03,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:39:03,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:39:03,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:39:03,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:39:03,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:39:03,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:39:03,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:39:03,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:39:03,418 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:39:03,419 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:39:03,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:39:03,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:39:03,422 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:39:03,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:39:03,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:39:03,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:39:03,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:39:03,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:39:03,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:39:03,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:39:03,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:39:03,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:39:03,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:39:03,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:39:03,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:39:03,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:39:03,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:39:03,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:39:03,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:39:03,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:39:03,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:39:03,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:39:03,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:39:03,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:39:03,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:39:03,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:39:03,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:39:03,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:39:03,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:39:03,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:39:03,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:39:03,474 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:39:03,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:39:03,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:39:03,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:39:03,475 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:39:03,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:39:03,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:39:03,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:39:03,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:39:03,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:39:03,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:39:03,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:39:03,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:39:03,477 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:39:03,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:39:03,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:39:03,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:39:03,479 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:39:03,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:39:03,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:39:03,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:39:03,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:39:03,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:39:03,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:39:03,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:39:03,785 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:39:03,785 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:39:03,786 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:39:04,780 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:39:05,026 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:39:05,027 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:39:05,035 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425425642/31c8846583544f7189c1b702b1347295/FLAG3e1a392b0 [2022-12-06 06:39:05,047 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/425425642/31c8846583544f7189c1b702b1347295 [2022-12-06 06:39:05,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:39:05,050 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:39:05,051 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:39:05,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:39:05,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:39:05,053 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60d30611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05, skipping insertion in model container [2022-12-06 06:39:05,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,058 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:39:05,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:39:05,199 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 06:39:05,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,358 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,369 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,389 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:39:05,403 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:39:05,416 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/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-06 06:39:05,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:39:05,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:39:05,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:39:05,491 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:39:05,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05 WrapperNode [2022-12-06 06:39:05,492 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:39:05,493 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:39:05,493 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:39:05,493 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:39:05,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,550 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2022-12-06 06:39:05,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:39:05,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:39:05,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:39:05,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:39:05,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,578 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,579 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:39:05,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:39:05,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:39:05,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:39:05,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (1/1) ... [2022-12-06 06:39:05,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:39:05,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:39:05,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:39:05,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:39:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:39:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:39:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:39:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:39:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:39:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:39:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:39:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:39:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:39:05,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:39:05,660 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:39:05,786 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:39:05,796 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:39:06,085 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:39:06,169 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:39:06,169 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:39:06,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:39:06 BoogieIcfgContainer [2022-12-06 06:39:06,171 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:39:06,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:39:06,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:39:06,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:39:06,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:39:05" (1/3) ... [2022-12-06 06:39:06,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:39:06, skipping insertion in model container [2022-12-06 06:39:06,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:39:05" (2/3) ... [2022-12-06 06:39:06,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f2aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:39:06, skipping insertion in model container [2022-12-06 06:39:06,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:39:06" (3/3) ... [2022-12-06 06:39:06,176 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-06 06:39:06,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:39:06,197 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:39:06,197 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:39:06,244 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:39:06,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:39:06,322 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:39:06,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:06,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:39:06,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2022-12-06 06:39:06,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2022-12-06 06:39:06,335 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:06,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:39:06,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2022-12-06 06:39:06,396 INFO L130 PetriNetUnfolder]: 2/104 cut-off events. [2022-12-06 06:39:06,397 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:06,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2022-12-06 06:39:06,399 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2022-12-06 06:39:06,399 INFO L188 LiptonReduction]: Number of co-enabled transitions 1790 [2022-12-06 06:39:09,911 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-06 06:39:09,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:39:09,929 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;@2a524fa8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:39:09,929 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:39:09,932 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-06 06:39:09,932 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:09,932 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:09,933 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:39:09,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 440823409, now seen corresponding path program 1 times [2022-12-06 06:39:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:09,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060102807] [2022-12-06 06:39:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:09,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:10,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060102807] [2022-12-06 06:39:10,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060102807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:10,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:39:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952854016] [2022-12-06 06:39:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:10,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:39:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:39:10,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:39:10,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2022-12-06 06:39:10,234 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:10,234 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:10,235 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2022-12-06 06:39:10,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:10,413 INFO L130 PetriNetUnfolder]: 879/1432 cut-off events. [2022-12-06 06:39:10,414 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:39:10,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 1432 events. 879/1432 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7327 event pairs, 144 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 2788. Up to 1060 conditions per place. [2022-12-06 06:39:10,422 INFO L137 encePairwiseOnDemand]: 21/26 looper letters, 27 selfloop transitions, 2 changer transitions 6/37 dead transitions. [2022-12-06 06:39:10,422 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-06 06:39:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:39:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:39:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-12-06 06:39:10,430 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 06:39:10,431 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 46 transitions. [2022-12-06 06:39:10,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-06 06:39:10,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:39:10,435 INFO L231 Difference]: Finished difference. Result has 32 places, 20 transitions, 50 flow [2022-12-06 06:39:10,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2022-12-06 06:39:10,438 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2022-12-06 06:39:10,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:10,439 INFO L89 Accepts]: Start accepts. Operand has 32 places, 20 transitions, 50 flow [2022-12-06 06:39:10,441 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:10,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:10,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 50 flow [2022-12-06 06:39:10,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:39:10,445 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:39:10,445 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:39:10,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:39:10,445 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:39:10,445 INFO L188 LiptonReduction]: Number of co-enabled transitions 186 [2022-12-06 06:39:10,539 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:10,540 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 102 [2022-12-06 06:39:10,540 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 50 flow [2022-12-06 06:39:10,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:10,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:10,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:10,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:39:10,541 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:10,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1675055669, now seen corresponding path program 1 times [2022-12-06 06:39:10,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:10,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120808124] [2022-12-06 06:39:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:10,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:10,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120808124] [2022-12-06 06:39:10,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120808124] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:10,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:10,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:39:10,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811521158] [2022-12-06 06:39:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:10,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:39:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:39:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:39:10,697 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:39:10,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:10,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:10,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:39:10,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:10,847 INFO L130 PetriNetUnfolder]: 916/1419 cut-off events. [2022-12-06 06:39:10,847 INFO L131 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-12-06 06:39:10,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3005 conditions, 1419 events. 916/1419 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 6763 event pairs, 364 based on Foata normal form. 52/1470 useless extension candidates. Maximal degree in co-relation 2995. Up to 903 conditions per place. [2022-12-06 06:39:10,854 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2022-12-06 06:39:10,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 154 flow [2022-12-06 06:39:10,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:39:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:39:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-06 06:39:10,855 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2022-12-06 06:39:10,855 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 50 flow. Second operand 3 states and 38 transitions. [2022-12-06 06:39:10,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 154 flow [2022-12-06 06:39:10,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:39:10,857 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,857 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2022-12-06 06:39:10,857 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -5 predicate places. [2022-12-06 06:39:10,857 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:10,857 INFO L89 Accepts]: Start accepts. Operand has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,858 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:10,858 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:10,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,878 INFO L130 PetriNetUnfolder]: 11/60 cut-off events. [2022-12-06 06:39:10,879 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:39:10,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 60 events. 11/60 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 213 event pairs, 7 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 99. Up to 26 conditions per place. [2022-12-06 06:39:10,879 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,879 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 06:39:10,950 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:10,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 94 [2022-12-06 06:39:10,952 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2022-12-06 06:39:10,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:10,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:10,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:10,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:39:10,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:10,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:10,953 INFO L85 PathProgramCache]: Analyzing trace with hash -387118191, now seen corresponding path program 1 times [2022-12-06 06:39:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:10,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495883847] [2022-12-06 06:39:10,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:10,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:11,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:11,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495883847] [2022-12-06 06:39:11,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495883847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:11,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:11,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:39:11,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609985055] [2022-12-06 06:39:11,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:11,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:11,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:11,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:11,062 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:39:11,062 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:11,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:39:11,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:11,237 INFO L130 PetriNetUnfolder]: 887/1380 cut-off events. [2022-12-06 06:39:11,238 INFO L131 PetriNetUnfolder]: For 170/170 co-relation queries the response was YES. [2022-12-06 06:39:11,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3317 conditions, 1380 events. 887/1380 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6358 event pairs, 147 based on Foata normal form. 12/1388 useless extension candidates. Maximal degree in co-relation 3306. Up to 697 conditions per place. [2022-12-06 06:39:11,245 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2022-12-06 06:39:11,245 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 39 transitions, 188 flow [2022-12-06 06:39:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:11,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-12-06 06:39:11,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.525 [2022-12-06 06:39:11,246 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 4 states and 42 transitions. [2022-12-06 06:39:11,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 39 transitions, 188 flow [2022-12-06 06:39:11,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:39:11,248 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,248 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-06 06:39:11,249 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2022-12-06 06:39:11,249 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:11,249 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,249 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:11,250 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:11,250 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,255 INFO L130 PetriNetUnfolder]: 8/55 cut-off events. [2022-12-06 06:39:11,255 INFO L131 PetriNetUnfolder]: For 21/27 co-relation queries the response was YES. [2022-12-06 06:39:11,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 55 events. 8/55 cut-off events. For 21/27 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 175 event pairs, 4 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 109. Up to 21 conditions per place. [2022-12-06 06:39:11,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-06 06:39:11,256 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:11,257 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:39:11,257 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 96 flow [2022-12-06 06:39:11,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,257 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:11,258 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:11,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:39:11,258 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:11,258 INFO L85 PathProgramCache]: Analyzing trace with hash -387119276, now seen corresponding path program 1 times [2022-12-06 06:39:11,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:11,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674423685] [2022-12-06 06:39:11,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:11,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674423685] [2022-12-06 06:39:11,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674423685] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:11,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:11,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:39:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408706373] [2022-12-06 06:39:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:11,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:39:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:11,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:39:11,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:39:11,371 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:39:11,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:11,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:39:11,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:11,517 INFO L130 PetriNetUnfolder]: 859/1333 cut-off events. [2022-12-06 06:39:11,517 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2022-12-06 06:39:11,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3469 conditions, 1333 events. 859/1333 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6186 event pairs, 229 based on Foata normal form. 4/1336 useless extension candidates. Maximal degree in co-relation 3455. Up to 1269 conditions per place. [2022-12-06 06:39:11,524 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 29 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2022-12-06 06:39:11,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 191 flow [2022-12-06 06:39:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:39:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:39:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:39:11,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-06 06:39:11,525 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 96 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:39:11,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 191 flow [2022-12-06 06:39:11,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:39:11,526 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,527 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2022-12-06 06:39:11,527 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 0 predicate places. [2022-12-06 06:39:11,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:11,527 INFO L89 Accepts]: Start accepts. Operand has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,528 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:11,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:11,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,533 INFO L130 PetriNetUnfolder]: 6/49 cut-off events. [2022-12-06 06:39:11,533 INFO L131 PetriNetUnfolder]: For 27/33 co-relation queries the response was YES. [2022-12-06 06:39:11,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 49 events. 6/49 cut-off events. For 27/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 3 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 103. Up to 18 conditions per place. [2022-12-06 06:39:11,533 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,533 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-06 06:39:11,534 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:11,535 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 06:39:11,535 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 109 flow [2022-12-06 06:39:11,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,535 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:11,535 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:11,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:39:11,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:11,536 INFO L85 PathProgramCache]: Analyzing trace with hash 884236878, now seen corresponding path program 1 times [2022-12-06 06:39:11,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:11,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592318972] [2022-12-06 06:39:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:11,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:11,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:11,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592318972] [2022-12-06 06:39:11,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592318972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:11,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:11,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:39:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173440467] [2022-12-06 06:39:11,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:11,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:11,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:11,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:11,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:11,605 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-06 06:39:11,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,605 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:11,605 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-06 06:39:11,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:11,810 INFO L130 PetriNetUnfolder]: 1249/1977 cut-off events. [2022-12-06 06:39:11,810 INFO L131 PetriNetUnfolder]: For 1271/1290 co-relation queries the response was YES. [2022-12-06 06:39:11,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4997 conditions, 1977 events. 1249/1977 cut-off events. For 1271/1290 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 9883 event pairs, 346 based on Foata normal form. 70/2035 useless extension candidates. Maximal degree in co-relation 4982. Up to 747 conditions per place. [2022-12-06 06:39:11,818 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 32 selfloop transitions, 4 changer transitions 12/50 dead transitions. [2022-12-06 06:39:11,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 300 flow [2022-12-06 06:39:11,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:11,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-06 06:39:11,820 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.55 [2022-12-06 06:39:11,820 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 109 flow. Second operand 4 states and 44 transitions. [2022-12-06 06:39:11,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 300 flow [2022-12-06 06:39:11,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 281 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:39:11,822 INFO L231 Difference]: Finished difference. Result has 38 places, 25 transitions, 116 flow [2022-12-06 06:39:11,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2022-12-06 06:39:11,823 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:39:11,823 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:11,823 INFO L89 Accepts]: Start accepts. Operand has 38 places, 25 transitions, 116 flow [2022-12-06 06:39:11,824 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:11,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:11,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 116 flow [2022-12-06 06:39:11,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 116 flow [2022-12-06 06:39:11,829 INFO L130 PetriNetUnfolder]: 6/49 cut-off events. [2022-12-06 06:39:11,829 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 06:39:11,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 49 events. 6/49 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 3 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 112. Up to 18 conditions per place. [2022-12-06 06:39:11,829 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 116 flow [2022-12-06 06:39:11,829 INFO L188 LiptonReduction]: Number of co-enabled transitions 194 [2022-12-06 06:39:11,914 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:39:11,915 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 92 [2022-12-06 06:39:11,915 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 114 flow [2022-12-06 06:39:11,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,915 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:11,916 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:11,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:39:11,916 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash -632775511, now seen corresponding path program 1 times [2022-12-06 06:39:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:11,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312167057] [2022-12-06 06:39:11,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:11,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312167057] [2022-12-06 06:39:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312167057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:11,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:11,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:39:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797892155] [2022-12-06 06:39:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:11,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:39:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:11,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:39:11,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:39:11,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:39:11,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:11,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:11,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:39:11,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:12,081 INFO L130 PetriNetUnfolder]: 356/621 cut-off events. [2022-12-06 06:39:12,081 INFO L131 PetriNetUnfolder]: For 570/578 co-relation queries the response was YES. [2022-12-06 06:39:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 621 events. 356/621 cut-off events. For 570/578 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2593 event pairs, 97 based on Foata normal form. 32/652 useless extension candidates. Maximal degree in co-relation 1673. Up to 503 conditions per place. [2022-12-06 06:39:12,084 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 35 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-06 06:39:12,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 262 flow [2022-12-06 06:39:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:39:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:39:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:39:12,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2022-12-06 06:39:12,085 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 114 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:39:12,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 262 flow [2022-12-06 06:39:12,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 241 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-06 06:39:12,087 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2022-12-06 06:39:12,087 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2022-12-06 06:39:12,087 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:12,087 INFO L89 Accepts]: Start accepts. Operand has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:12,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:12,088 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,098 INFO L130 PetriNetUnfolder]: 46/141 cut-off events. [2022-12-06 06:39:12,098 INFO L131 PetriNetUnfolder]: For 45/77 co-relation queries the response was YES. [2022-12-06 06:39:12,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 141 events. 46/141 cut-off events. For 45/77 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 658 event pairs, 18 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 305. Up to 78 conditions per place. [2022-12-06 06:39:12,099 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,099 INFO L188 LiptonReduction]: Number of co-enabled transitions 204 [2022-12-06 06:39:12,117 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:12,118 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31 [2022-12-06 06:39:12,118 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 126 flow [2022-12-06 06:39:12,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:12,118 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:12,118 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:12,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:39:12,118 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:12,119 INFO L85 PathProgramCache]: Analyzing trace with hash 174780791, now seen corresponding path program 1 times [2022-12-06 06:39:12,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:12,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573643928] [2022-12-06 06:39:12,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:12,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:12,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:12,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573643928] [2022-12-06 06:39:12,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573643928] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:12,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:12,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:39:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754609722] [2022-12-06 06:39:12,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:12,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:12,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:12,242 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:39:12,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:12,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:12,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:39:12,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:12,336 INFO L130 PetriNetUnfolder]: 181/350 cut-off events. [2022-12-06 06:39:12,336 INFO L131 PetriNetUnfolder]: For 216/217 co-relation queries the response was YES. [2022-12-06 06:39:12,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 350 events. 181/350 cut-off events. For 216/217 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1290 event pairs, 53 based on Foata normal form. 34/383 useless extension candidates. Maximal degree in co-relation 1065. Up to 125 conditions per place. [2022-12-06 06:39:12,338 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 43 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2022-12-06 06:39:12,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 325 flow [2022-12-06 06:39:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:12,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-12-06 06:39:12,339 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2022-12-06 06:39:12,339 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 126 flow. Second operand 4 states and 46 transitions. [2022-12-06 06:39:12,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 325 flow [2022-12-06 06:39:12,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:39:12,340 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,340 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-06 06:39:12,341 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2022-12-06 06:39:12,341 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:12,341 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,341 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:12,342 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:12,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,349 INFO L130 PetriNetUnfolder]: 22/86 cut-off events. [2022-12-06 06:39:12,349 INFO L131 PetriNetUnfolder]: For 50/61 co-relation queries the response was YES. [2022-12-06 06:39:12,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 86 events. 22/86 cut-off events. For 50/61 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 304 event pairs, 3 based on Foata normal form. 7/91 useless extension candidates. Maximal degree in co-relation 240. Up to 47 conditions per place. [2022-12-06 06:39:12,349 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 184 [2022-12-06 06:39:12,350 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:39:12,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-06 06:39:12,351 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 162 flow [2022-12-06 06:39:12,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:12,351 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:12,351 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:12,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:39:12,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:12,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1205899686, now seen corresponding path program 1 times [2022-12-06 06:39:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:12,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681101851] [2022-12-06 06:39:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:12,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:12,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681101851] [2022-12-06 06:39:12,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681101851] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:12,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:12,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:39:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714161470] [2022-12-06 06:39:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:39:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:39:12,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:39:12,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 19 [2022-12-06 06:39:12,486 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:12,486 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:12,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 19 [2022-12-06 06:39:12,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:12,561 INFO L130 PetriNetUnfolder]: 147/278 cut-off events. [2022-12-06 06:39:12,561 INFO L131 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-12-06 06:39:12,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 278 events. 147/278 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 968 event pairs, 48 based on Foata normal form. 14/291 useless extension candidates. Maximal degree in co-relation 929. Up to 111 conditions per place. [2022-12-06 06:39:12,562 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 34 selfloop transitions, 10 changer transitions 6/52 dead transitions. [2022-12-06 06:39:12,562 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 349 flow [2022-12-06 06:39:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:39:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:39:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-12-06 06:39:12,563 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2022-12-06 06:39:12,563 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 162 flow. Second operand 5 states and 47 transitions. [2022-12-06 06:39:12,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 349 flow [2022-12-06 06:39:12,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 325 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-06 06:39:12,565 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 169 flow [2022-12-06 06:39:12,565 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-06 06:39:12,565 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2022-12-06 06:39:12,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:12,565 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 169 flow [2022-12-06 06:39:12,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:12,566 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:12,566 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 169 flow [2022-12-06 06:39:12,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 169 flow [2022-12-06 06:39:12,572 INFO L130 PetriNetUnfolder]: 15/58 cut-off events. [2022-12-06 06:39:12,572 INFO L131 PetriNetUnfolder]: For 63/66 co-relation queries the response was YES. [2022-12-06 06:39:12,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 58 events. 15/58 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 142 event pairs, 1 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 166. Up to 25 conditions per place. [2022-12-06 06:39:12,572 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 169 flow [2022-12-06 06:39:12,572 INFO L188 LiptonReduction]: Number of co-enabled transitions 140 [2022-12-06 06:39:12,871 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:39:12,872 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 307 [2022-12-06 06:39:12,872 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 165 flow [2022-12-06 06:39:12,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:12,872 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:12,872 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:12,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:39:12,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:12,873 INFO L85 PathProgramCache]: Analyzing trace with hash -384784811, now seen corresponding path program 1 times [2022-12-06 06:39:12,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:12,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830655616] [2022-12-06 06:39:12,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:12,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:13,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:13,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:13,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830655616] [2022-12-06 06:39:13,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830655616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:13,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:13,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:39:13,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358341159] [2022-12-06 06:39:13,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:13,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:39:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:13,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:39:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:39:13,064 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 06:39:13,064 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 165 flow. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:13,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:13,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 06:39:13,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:13,125 INFO L130 PetriNetUnfolder]: 173/324 cut-off events. [2022-12-06 06:39:13,125 INFO L131 PetriNetUnfolder]: For 529/529 co-relation queries the response was YES. [2022-12-06 06:39:13,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 324 events. 173/324 cut-off events. For 529/529 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1241 event pairs, 21 based on Foata normal form. 1/325 useless extension candidates. Maximal degree in co-relation 1133. Up to 193 conditions per place. [2022-12-06 06:39:13,127 INFO L137 encePairwiseOnDemand]: 12/17 looper letters, 27 selfloop transitions, 4 changer transitions 15/46 dead transitions. [2022-12-06 06:39:13,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 358 flow [2022-12-06 06:39:13,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:39:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:39:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-12-06 06:39:13,128 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:39:13,128 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 165 flow. Second operand 4 states and 34 transitions. [2022-12-06 06:39:13,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 358 flow [2022-12-06 06:39:13,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 306 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 06:39:13,130 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 122 flow [2022-12-06 06:39:13,130 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2022-12-06 06:39:13,131 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 06:39:13,131 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:13,131 INFO L89 Accepts]: Start accepts. Operand has 40 places, 23 transitions, 122 flow [2022-12-06 06:39:13,133 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:13,133 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:13,133 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 122 flow [2022-12-06 06:39:13,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 122 flow [2022-12-06 06:39:13,137 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-06 06:39:13,137 INFO L131 PetriNetUnfolder]: For 30/33 co-relation queries the response was YES. [2022-12-06 06:39:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 26 events. 5/26 cut-off events. For 30/33 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 3/29 useless extension candidates. Maximal degree in co-relation 65. Up to 8 conditions per place. [2022-12-06 06:39:13,137 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 122 flow [2022-12-06 06:39:13,137 INFO L188 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-06 06:39:13,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [440] $Ultimate##0-->L807: Formula: (and (= v_P2Thread1of1ForFork1_~arg.base_19 |v_P2Thread1of1ForFork1_#in~arg.base_19|) (= v_~z~0_75 1) (= v_P2Thread1of1ForFork1_~arg.offset_19 |v_P2Thread1of1ForFork1_#in~arg.offset_19|) (= v_~y~0_41 v_~__unbuffered_p2_EAX~0_64)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~y~0=v_~y~0_41} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_19|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_19, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_19|, ~z~0=v_~z~0_75, ~y~0=v_~y~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, ~__unbuffered_p2_EAX~0, ~z~0] and [416] $Ultimate##0-->L745: Formula: (and (= v_P0Thread1of1ForFork2_~arg.offset_5 |v_P0Thread1of1ForFork2_#in~arg.offset_5|) (= v_P0Thread1of1ForFork2_~arg.base_5 |v_P0Thread1of1ForFork2_#in~arg.base_5|) (= v_~z~0_23 2)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_5|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_5|} OutVars{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|, ~z~0=v_~z~0_23, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_5} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:39:13,173 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:39:13,175 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-06 06:39:13,175 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 21 transitions, 110 flow [2022-12-06 06:39:13,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:13,175 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:13,175 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:13,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:39:13,175 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:13,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1103002129, now seen corresponding path program 1 times [2022-12-06 06:39:13,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:13,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657034977] [2022-12-06 06:39:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:13,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:39:13,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:39:13,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:39:13,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657034977] [2022-12-06 06:39:13,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657034977] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:39:13,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:39:13,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:39:13,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864890846] [2022-12-06 06:39:13,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:39:13,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:39:13,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:39:13,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:39:13,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:39:13,944 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:39:13,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 21 transitions, 110 flow. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:13,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:39:13,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:39:13,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:39:14,037 INFO L130 PetriNetUnfolder]: 48/107 cut-off events. [2022-12-06 06:39:14,038 INFO L131 PetriNetUnfolder]: For 157/157 co-relation queries the response was YES. [2022-12-06 06:39:14,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 107 events. 48/107 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 312 event pairs, 11 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 350. Up to 50 conditions per place. [2022-12-06 06:39:14,038 INFO L137 encePairwiseOnDemand]: 9/15 looper letters, 21 selfloop transitions, 4 changer transitions 20/45 dead transitions. [2022-12-06 06:39:14,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 313 flow [2022-12-06 06:39:14,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:39:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:39:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-12-06 06:39:14,039 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2022-12-06 06:39:14,039 INFO L175 Difference]: Start difference. First operand has 37 places, 21 transitions, 110 flow. Second operand 6 states and 32 transitions. [2022-12-06 06:39:14,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 313 flow [2022-12-06 06:39:14,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 283 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-12-06 06:39:14,041 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 117 flow [2022-12-06 06:39:14,041 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=117, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2022-12-06 06:39:14,041 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2022-12-06 06:39:14,041 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:39:14,041 INFO L89 Accepts]: Start accepts. Operand has 38 places, 23 transitions, 117 flow [2022-12-06 06:39:14,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:39:14,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:39:14,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 23 transitions, 117 flow [2022-12-06 06:39:14,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 23 transitions, 117 flow [2022-12-06 06:39:14,046 INFO L130 PetriNetUnfolder]: 10/37 cut-off events. [2022-12-06 06:39:14,046 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 06:39:14,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 37 events. 10/37 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 78 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 96. Up to 12 conditions per place. [2022-12-06 06:39:14,047 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 23 transitions, 117 flow [2022-12-06 06:39:14,047 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 06:39:14,239 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0~0_199 v_~x$w_buff1~0_169) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_288 256) 0)) (not (= (mod v_~x$w_buff0_used~0_322 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|) (= v_~x$w_buff0~0_198 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff1_thd0~0_110) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| 0)) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_288) (= v_~x$w_buff0_used~0_322 1) (= v_~x$r_buff0_thd1~0_108 v_~x$r_buff1_thd1~0_108) (= v_~x$r_buff0_thd2~0_124 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~x$r_buff1_thd2~0_94 v_~x$r_buff0_thd2~0_125) (= v_~y~0_39 1) (= v_~x$r_buff0_thd3~0_118 v_~x$r_buff1_thd3~0_120) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_108, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_118, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_125, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_198, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_108, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_169, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_120, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_288, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_108, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_118, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_110, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [442] $Ultimate##0-->L763: Formula: (let ((.cse3 (= (mod v_~x$r_buff1_thd1~0_119 256) 0)) (.cse9 (= (mod v_~x$r_buff0_thd1~0_119 256) 0))) (let ((.cse10 (not .cse9)) (.cse7 (and (= (mod v_~x$w_buff1_used~0_311 256) 0) .cse9)) (.cse11 (= (mod v_~x$w_buff0_used~0_347 256) 0)) (.cse8 (and .cse9 .cse3))) (let ((.cse5 (or .cse7 .cse11 .cse8)) (.cse6 (and .cse10 (not .cse11))) (.cse0 (not (= (mod v_~weak$$choice2~0_72 256) 0))) (.cse2 (= (mod v_~x$w_buff1_used~0_310 256) 0)) (.cse4 (= (mod v_~x$w_buff0_used~0_346 256) 0))) (and (= (ite .cse0 v_~x$r_buff1_thd1~0_119 (ite (let ((.cse1 (= 0 (mod v_~x$r_buff0_thd1~0_118 256)))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~x$r_buff1_thd1~0_119 0)) v_~x$r_buff1_thd1~0_118) (= (ite .cse0 v_~x$mem_tmp~0_56 v_~__unbuffered_p0_EAX~0_78) v_~x~0_262) (= v_~weak$$choice2~0_72 |v_P0Thread1of1ForFork2_#t~nondet4_54|) (= v_~x$flush_delayed~0_65 0) (= v_P0Thread1of1ForFork2_~arg.base_17 |v_P0Thread1of1ForFork2_#in~arg.base_17|) (= v_~x$w_buff1~0_184 v_~x$w_buff1~0_183) (= v_~x$w_buff0_used~0_346 (ite .cse0 v_~x$w_buff0_used~0_347 (ite .cse5 v_~x$w_buff0_used~0_347 (ite .cse6 0 v_~x$w_buff0_used~0_347)))) (= (ite .cse5 v_~x~0_263 (ite .cse6 v_~x$w_buff0~0_215 v_~x$w_buff1~0_184)) v_~__unbuffered_p0_EAX~0_78) (= v_~weak$$choice0~0_53 |v_P0Thread1of1ForFork2_#t~nondet3_54|) (= v_~x$w_buff1_used~0_310 (ite .cse0 v_~x$w_buff1_used~0_311 (ite (or .cse7 .cse4 .cse8) v_~x$w_buff1_used~0_311 0))) (= v_~x$mem_tmp~0_56 v_~x~0_263) (= v_P2Thread1of1ForFork1_~arg.offset_23 |v_P2Thread1of1ForFork1_#in~arg.offset_23|) (= v_~z~0_81 2) (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_17) (= v_~x$r_buff0_thd1~0_118 (ite .cse0 v_~x$r_buff0_thd1~0_119 (ite (or (and .cse2 .cse9) .cse4 .cse8) v_~x$r_buff0_thd1~0_119 (ite (and .cse10 (not .cse4)) 0 v_~x$r_buff0_thd1~0_119)))) (= v_P2Thread1of1ForFork1_~arg.base_23 |v_P2Thread1of1ForFork1_#in~arg.base_23|) (= v_~y~0_45 v_~__unbuffered_p2_EAX~0_68) (= v_~x$w_buff0~0_215 v_~x$w_buff0~0_214))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_215, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_119, ~x$w_buff1~0=v_~x$w_buff1~0_184, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_311, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_119, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_347, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, P0Thread1of1ForFork2_#t~nondet4=|v_P0Thread1of1ForFork2_#t~nondet4_54|, ~y~0=v_~y~0_45, ~x~0=v_~x~0_263, P0Thread1of1ForFork2_#t~nondet3=|v_P0Thread1of1ForFork2_#t~nondet3_54|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_214, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_118, ~x$flush_delayed~0=v_~x$flush_delayed~0_65, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_118, ~x$mem_tmp~0=v_~x$mem_tmp~0_56, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_17, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_78, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_23, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~y~0=v_~y~0_45, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_23|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_23, ~x$w_buff1~0=v_~x$w_buff1~0_183, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_310, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_346, ~weak$$choice0~0=v_~weak$$choice0~0_53, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_23|, ~z~0=v_~z~0_81, ~weak$$choice2~0=v_~weak$$choice2~0_72, ~x~0=v_~x~0_262} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, P2Thread1of1ForFork1_~arg.offset, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~weak$$choice2~0, P0Thread1of1ForFork2_#t~nondet4, ~x~0, P0Thread1of1ForFork2_#t~nondet3] [2022-12-06 06:39:14,557 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [437] $Ultimate##0-->L787: Formula: (and (= v_~x$w_buff0~0_199 v_~x$w_buff1~0_169) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_288 256) 0)) (not (= (mod v_~x$w_buff0_used~0_322 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|) (= v_~x$w_buff0~0_198 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_30| |v_P1Thread1of1ForFork0_#in~arg#1.base_30|) (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff1_thd0~0_110) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| 0)) (= v_~x$w_buff0_used~0_323 v_~x$w_buff1_used~0_288) (= v_~x$w_buff0_used~0_322 1) (= v_~x$r_buff0_thd1~0_108 v_~x$r_buff1_thd1~0_108) (= v_~x$r_buff0_thd2~0_124 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_30| |v_P1Thread1of1ForFork0_~arg#1.offset_30|) (= v_~x$r_buff1_thd2~0_94 v_~x$r_buff0_thd2~0_125) (= v_~y~0_39 1) (= v_~x$r_buff0_thd3~0_118 v_~x$r_buff1_thd3~0_120) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_199, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_108, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_118, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_125, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_323} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_198, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_34|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_108, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_30|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_30|, ~x$w_buff1~0=v_~x$w_buff1~0_169, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_120, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_94, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_288, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_108, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_34|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_118, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_124, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_110, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_30|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_322, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_30|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~y~0] and [441] $Ultimate##0-->L745: Formula: (and (= v_P2Thread1of1ForFork1_~arg.offset_21 |v_P2Thread1of1ForFork1_#in~arg.offset_21|) (= v_~z~0_77 2) (= v_~y~0_43 v_~__unbuffered_p2_EAX~0_66) (= v_P2Thread1of1ForFork1_~arg.base_21 |v_P2Thread1of1ForFork1_#in~arg.base_21|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_15| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_15|)) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~y~0=v_~y~0_43} OutVars{P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_15|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_21, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_21, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_15|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_66, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_21|, ~z~0=v_~z~0_77, ~y~0=v_~y~0_43, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15} AuxVars[] AssignedVars[P2Thread1of1ForFork1_~arg.offset, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, P0Thread1of1ForFork2_~arg.base] [2022-12-06 06:39:14,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [444] $Ultimate##0-->L745: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_21| v_P0Thread1of1ForFork2_~arg.offset_21) (= v_P2Thread1of1ForFork1_~arg.base_27 |v_P2Thread1of1ForFork1_#in~arg.base_27|) (= v_~x$r_buff0_thd2~0_132 1) (= v_~y~0_49 v_~__unbuffered_p2_EAX~0_72) (= v_~x$w_buff0_used~0_356 1) (= v_~x$r_buff0_thd3~0_130 v_~x$r_buff1_thd3~0_132) (= v_~x$w_buff0~0_224 1) (= |v_P1Thread1of1ForFork0_~arg#1.base_34| |v_P1Thread1of1ForFork0_#in~arg#1.base_34|) (= v_~x$r_buff0_thd1~0_126 v_~x$r_buff1_thd1~0_126) (= v_P0Thread1of1ForFork2_~arg.base_21 |v_P0Thread1of1ForFork2_#in~arg.base_21|) (= v_~y~0_49 1) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_34| |v_P1Thread1of1ForFork0_~arg#1.offset_34|) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|) (= (ite (not (and (not (= (mod v_~x$w_buff1_used~0_318 256) 0)) (not (= (mod v_~x$w_buff0_used~0_356 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|) (= v_~x$w_buff0~0_225 v_~x$w_buff1~0_191) (= v_~x$r_buff1_thd2~0_98 v_~x$r_buff0_thd2~0_133) (= v_~x$r_buff0_thd0~0_123 v_~x$r_buff1_thd0~0_122) (= v_P2Thread1of1ForFork1_~arg.offset_27 |v_P2Thread1of1ForFork1_#in~arg.offset_27|) (= v_~x$w_buff0_used~0_357 v_~x$w_buff1_used~0_318) (= v_~z~0_85 2) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38| 0))) InVars {P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~x$w_buff0~0=v_~x$w_buff0~0_225, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_126, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_130, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_133, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_357, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_224, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_126, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_34|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_38|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_130, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_34|, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_21, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_34|, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_21|, P2Thread1of1ForFork1_~arg.base=v_P2Thread1of1ForFork1_~arg.base_27, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_72, ~y~0=v_~y~0_49, P2Thread1of1ForFork1_#in~arg.offset=|v_P2Thread1of1ForFork1_#in~arg.offset_27|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_38|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_34|, P2Thread1of1ForFork1_~arg.offset=v_P2Thread1of1ForFork1_~arg.offset_27, ~x$w_buff1~0=v_~x$w_buff1~0_191, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_318, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_21|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_132, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_122, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_356, P2Thread1of1ForFork1_#in~arg.base=|v_P2Thread1of1ForFork1_#in~arg.base_27|, ~z~0=v_~z~0_85} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, P2Thread1of1ForFork1_~arg.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P2Thread1of1ForFork1_~arg.base, P0Thread1of1ForFork2_~arg.offset, ~__unbuffered_p2_EAX~0, ~z~0, ~y~0] and [329] L807-->L814: Formula: (let ((.cse2 (not (= (mod v_~x$r_buff1_thd3~0_22 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_93 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_24 256) 0)))) (let ((.cse1 (and .cse3 .cse5)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_94 256) 0)))) (.cse4 (and .cse2 (not (= (mod v_~x$w_buff1_used~0_81 256) 0))))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_94) v_~x$w_buff0_used~0_93) (= v_~x$r_buff0_thd3~0_23 (ite .cse1 0 v_~x$r_buff0_thd3~0_24)) (= v_~x$r_buff1_thd3~0_21 (ite (or (and .cse2 (not (= (mod v_~x$w_buff1_used~0_80 256) 0))) (and (not (= (mod v_~x$r_buff0_thd3~0_23 256) 0)) .cse3)) 0 v_~x$r_buff1_thd3~0_22)) (= v_~x$w_buff1_used~0_80 (ite (or .cse4 .cse1) 0 v_~x$w_buff1_used~0_81)) (= v_~x~0_50 (ite .cse0 v_~x$w_buff0~0_44 (ite .cse4 v_~x$w_buff1~0_35 v_~x~0_51)))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_24, ~x~0=v_~x~0_51, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_44, ~x$w_buff1~0=v_~x$w_buff1~0_35, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_21, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_93} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:39:14,919 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:39:14,919 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 878 [2022-12-06 06:39:14,920 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 116 flow [2022-12-06 06:39:14,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:39:14,920 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:39:14,920 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:14,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:39:14,920 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:39:14,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:39:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -408446585, now seen corresponding path program 1 times [2022-12-06 06:39:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:39:14,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947056936] [2022-12-06 06:39:14,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:39:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:39:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:14,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:39:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:39:15,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:39:15,029 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:39:15,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:39:15,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:39:15,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:39:15,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:39:15,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:39:15,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:39:15,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:39:15,031 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:39:15,039 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:39:15,039 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:39:15,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:39:15 BasicIcfg [2022-12-06 06:39:15,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:39:15,095 INFO L158 Benchmark]: Toolchain (without parser) took 10045.77ms. Allocated memory was 215.0MB in the beginning and 429.9MB in the end (delta: 215.0MB). Free memory was 190.0MB in the beginning and 297.4MB in the end (delta: -107.4MB). Peak memory consumption was 108.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory was 191.1MB in the beginning and 191.0MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.41ms. Allocated memory is still 215.0MB. Free memory was 189.4MB in the beginning and 163.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.89ms. Allocated memory is still 215.0MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: Boogie Preprocessor took 31.23ms. Allocated memory is still 215.0MB. Free memory was 160.6MB in the beginning and 158.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: RCFGBuilder took 587.89ms. Allocated memory is still 215.0MB. Free memory was 158.5MB in the beginning and 127.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,096 INFO L158 Benchmark]: TraceAbstraction took 8922.71ms. Allocated memory was 215.0MB in the beginning and 429.9MB in the end (delta: 215.0MB). Free memory was 126.5MB in the beginning and 297.4MB in the end (delta: -170.9MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-12-06 06:39:15,097 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 215.0MB. Free memory was 191.1MB in the beginning and 191.0MB in the end (delta: 80.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.41ms. Allocated memory is still 215.0MB. Free memory was 189.4MB in the beginning and 163.2MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.89ms. Allocated memory is still 215.0MB. Free memory was 162.7MB in the beginning and 160.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.23ms. Allocated memory is still 215.0MB. Free memory was 160.6MB in the beginning and 158.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 587.89ms. Allocated memory is still 215.0MB. Free memory was 158.5MB in the beginning and 127.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8922.71ms. Allocated memory was 215.0MB in the beginning and 429.9MB in the end (delta: 215.0MB). Free memory was 126.5MB in the beginning and 297.4MB in the end (delta: -170.9MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1569, independent: 1518, independent conditional: 1518, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1569, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1569, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1569, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1259, independent: 1223, independent conditional: 0, independent unconditional: 1223, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1259, independent: 1214, independent conditional: 0, independent unconditional: 1214, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1569, independent: 295, independent conditional: 0, independent unconditional: 295, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1259, unknown conditional: 0, unknown unconditional: 1259] , Statistics on independence cache: Total cache size (in pairs): 2042, Positive cache size: 2006, Positive conditional cache size: 0, Positive unconditional cache size: 2006, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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, 29 PlacesBefore, 29 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 186 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 85, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 85, independent: 65, independent conditional: 3, independent unconditional: 62, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 85, independent: 65, independent conditional: 3, independent unconditional: 62, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 85, independent: 65, independent conditional: 3, independent unconditional: 62, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 77, independent: 61, independent conditional: 3, independent unconditional: 58, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 77, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 91, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 88, dependent conditional: 35, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 85, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 77, unknown conditional: 6, unknown unconditional: 71] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 61, Positive conditional cache size: 3, Positive unconditional cache size: 58, Negative cache size: 16, Negative conditional cache size: 3, Negative unconditional cache size: 13, 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, 30 PlacesBefore, 30 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, independent: 47, independent conditional: 47, 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: 59, independent: 47, independent conditional: 16, independent unconditional: 31, dependent: 12, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, independent: 47, independent conditional: 0, independent unconditional: 47, 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: 59, independent: 47, independent conditional: 0, independent unconditional: 47, 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: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 66, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 91, Positive cache size: 68, Positive conditional cache size: 3, Positive unconditional cache size: 65, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 52, independent conditional: 52, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 52, independent conditional: 20, independent unconditional: 32, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 67, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 67, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 15, dependent conditional: 0, dependent unconditional: 15, 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: 67, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 33, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 11, independent unconditional: 22, dependent: 13, dependent conditional: 2, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, 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: 46, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 72, Positive conditional cache size: 3, Positive unconditional cache size: 69, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 194 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, independent: 43, independent conditional: 43, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 64, independent: 43, independent conditional: 23, independent unconditional: 20, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 64, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 64, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 75, Positive conditional cache size: 3, Positive unconditional cache size: 72, 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: 23, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 204 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 12, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 78, Positive conditional cache size: 3, Positive unconditional cache size: 75, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 20, independent conditional: 20, 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: 31, independent: 20, independent conditional: 14, independent unconditional: 6, 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: 31, independent: 20, independent conditional: 10, independent unconditional: 10, 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: 31, independent: 20, independent conditional: 10, independent unconditional: 10, 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: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 31, independent: 15, independent conditional: 8, independent unconditional: 7, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 109, Positive cache size: 83, Positive conditional cache size: 5, Positive unconditional cache size: 78, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 41 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 140 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 38, independent conditional: 38, 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: 56, independent: 38, independent conditional: 38, independent unconditional: 0, 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: 56, independent: 38, independent conditional: 20, independent unconditional: 18, 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: 56, independent: 38, independent conditional: 20, independent unconditional: 18, 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: 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: 56, independent: 38, independent conditional: 20, independent unconditional: 18, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 89, Positive conditional cache size: 5, Positive unconditional cache size: 84, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 18, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 37 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 94, Positive conditional cache size: 5, Positive unconditional cache size: 89, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 36 PlacesBefore, 34 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 96, Positive conditional cache size: 7, Positive unconditional cache size: 89, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2073, ((void *)0), P0, ((void *)0))=-2, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2074, ((void *)0), P1, ((void *)0))=-1, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2075, ((void *)0), P2, ((void *)0))=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 [L786] 2 y = 1 [L803] 2 __unbuffered_p2_EAX = y [L806] 2 z = 1 [L744] 2 z = 2 [L809] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 2 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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=66, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: 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: 836]: 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: 832]: 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, 133 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: 8.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 173 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 492 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 5 mSDtfsCounter, 492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=8, InterpolantAutomatonStates: 39, 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, 1.7s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:39:15,132 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...