/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:54:46,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:54:46,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:54:46,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:54:46,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:54:46,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:54:46,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:54:46,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:54:46,175 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:54:46,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:54:46,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:54:46,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:54:46,179 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:54:46,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:54:46,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:54:46,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:54:46,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:54:46,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:54:46,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:54:46,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:54:46,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:54:46,192 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:54:46,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:54:46,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:54:46,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:54:46,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:54:46,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:54:46,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:54:46,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:54:46,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:54:46,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:54:46,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:54:46,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:54:46,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:54:46,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:54:46,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:54:46,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:54:46,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:54:46,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:54:46,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:54:46,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:54:46,214 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:54:46,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:54:46,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:54:46,249 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:54:46,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:54:46,249 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:54:46,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:54:46,250 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:54:46,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:54:46,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:54:46,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:54:46,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:54:46,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:54:46,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:54:46,252 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:46,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:54:46,253 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:54:46,254 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-05 22:54:46,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:54:46,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:54:46,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:54:46,565 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:54:46,566 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:54:46,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-05 22:54:47,681 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:54:47,989 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:54:47,991 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2022-12-05 22:54:48,012 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd4f8fe0/946bf52baec640a9998d5b36c2c729f4/FLAGedf414ea4 [2022-12-05 22:54:48,022 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd4f8fe0/946bf52baec640a9998d5b36c2c729f4 [2022-12-05 22:54:48,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:54:48,025 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:54:48,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:48,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:54:48,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:54:48,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,030 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c849cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48, skipping insertion in model container [2022-12-05 22:54:48,030 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:54:48,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:54:48,191 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/mix013.opt.i[944,957] [2022-12-05 22:54:48,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,340 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,341 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,342 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,361 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:48,411 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:54:48,421 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/mix013.opt.i[944,957] [2022-12-05 22:54:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,453 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:54:48,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:54:48,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:54:48,510 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:54:48,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48 WrapperNode [2022-12-05 22:54:48,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:54:48,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:48,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:54:48,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:54:48,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,562 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-12-05 22:54:48,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:54:48,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:54:48,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:54:48,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:54:48,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,583 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:54:48,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:54:48,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:54:48,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:54:48,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (1/1) ... [2022-12-05 22:54:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:54:48,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:54:48,625 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-05 22:54:48,648 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-05 22:54:48,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:54:48,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:54:48,665 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:54:48,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:54:48,666 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:54:48,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:54:48,666 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 22:54:48,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 22:54:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:54:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:54:48,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:54:48,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:54:48,668 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 22:54:48,821 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:54:48,823 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:54:49,137 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:54:49,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:54:49,277 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:54:49,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:49 BoogieIcfgContainer [2022-12-05 22:54:49,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:54:49,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:54:49,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:54:49,284 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:54:49,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:54:48" (1/3) ... [2022-12-05 22:54:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7185cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:49, skipping insertion in model container [2022-12-05 22:54:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:54:48" (2/3) ... [2022-12-05 22:54:49,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7185cec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:54:49, skipping insertion in model container [2022-12-05 22:54:49,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:54:49" (3/3) ... [2022-12-05 22:54:49,289 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2022-12-05 22:54:49,303 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:54:49,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:54:49,304 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:54:49,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:54:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 22:54:49,471 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 22:54:49,471 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:49,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-05 22:54:49,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2022-12-05 22:54:49,482 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2022-12-05 22:54:49,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:49,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 22:54:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2022-12-05 22:54:49,529 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-12-05 22:54:49,529 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:49,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2022-12-05 22:54:49,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2022-12-05 22:54:49,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 2850 [2022-12-05 22:54:54,767 INFO L203 LiptonReduction]: Total number of compositions: 99 [2022-12-05 22:54:54,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:54:54,802 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;@25a3754c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:54:54,803 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 22:54:54,807 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-05 22:54:54,807 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:54,808 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:54,808 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:54,808 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1370343336, now seen corresponding path program 1 times [2022-12-05 22:54:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:54,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455278412] [2022-12-05 22:54:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:55,299 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-05 22:54:55,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:55,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455278412] [2022-12-05 22:54:55,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455278412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:55,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:55,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907667284] [2022-12-05 22:54:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:55,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:55,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:55,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:55,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-05 22:54:55,334 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-05 22:54:55,334 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:55,334 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-05 22:54:55,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:55,933 INFO L130 PetriNetUnfolder]: 3113/4520 cut-off events. [2022-12-05 22:54:55,933 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-05 22:54:55,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8914 conditions, 4520 events. 3113/4520 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 25050 event pairs, 593 based on Foata normal form. 0/4150 useless extension candidates. Maximal degree in co-relation 8902. Up to 3385 conditions per place. [2022-12-05 22:54:55,964 INFO L137 encePairwiseOnDemand]: 26/31 looper letters, 30 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-05 22:54:55,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 40 transitions, 164 flow [2022-12-05 22:54:55,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:55,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 22:54:55,974 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2022-12-05 22:54:55,975 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 53 transitions. [2022-12-05 22:54:55,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 40 transitions, 164 flow [2022-12-05 22:54:55,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 22:54:55,979 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 64 flow [2022-12-05 22:54:55,981 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2022-12-05 22:54:55,984 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2022-12-05 22:54:55,984 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:55,984 INFO L89 Accepts]: Start accepts. Operand has 39 places, 26 transitions, 64 flow [2022-12-05 22:54:55,986 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:55,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:55,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 64 flow [2022-12-05 22:54:55,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 26 transitions, 64 flow [2022-12-05 22:54:55,992 INFO L130 PetriNetUnfolder]: 0/26 cut-off events. [2022-12-05 22:54:55,992 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:55,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:54:55,993 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 26 transitions, 64 flow [2022-12-05 22:54:55,993 INFO L188 LiptonReduction]: Number of co-enabled transitions 336 [2022-12-05 22:54:56,102 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:56,104 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 120 [2022-12-05 22:54:56,104 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 64 flow [2022-12-05 22:54:56,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-05 22:54:56,104 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:56,104 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:56,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:54:56,105 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1655122961, now seen corresponding path program 1 times [2022-12-05 22:54:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:56,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769730564] [2022-12-05 22:54:56,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:56,286 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-05 22:54:56,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:56,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769730564] [2022-12-05 22:54:56,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769730564] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:56,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:56,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:54:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896959204] [2022-12-05 22:54:56,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:56,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:54:56,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:54:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:54:56,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:54:56,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-05 22:54:56,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:56,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:54:56,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:57,051 INFO L130 PetriNetUnfolder]: 5909/8022 cut-off events. [2022-12-05 22:54:57,051 INFO L131 PetriNetUnfolder]: For 304/304 co-relation queries the response was YES. [2022-12-05 22:54:57,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16570 conditions, 8022 events. 5909/8022 cut-off events. For 304/304 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 35155 event pairs, 2449 based on Foata normal form. 16/8038 useless extension candidates. Maximal degree in co-relation 16560. Up to 7831 conditions per place. [2022-12-05 22:54:57,092 INFO L137 encePairwiseOnDemand]: 20/26 looper letters, 37 selfloop transitions, 5 changer transitions 0/42 dead transitions. [2022-12-05 22:54:57,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 188 flow [2022-12-05 22:54:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:57,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-05 22:54:57,094 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2022-12-05 22:54:57,094 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 64 flow. Second operand 3 states and 43 transitions. [2022-12-05 22:54:57,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 188 flow [2022-12-05 22:54:57,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:57,097 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-05 22:54:57,098 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-05 22:54:57,098 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:57,098 INFO L89 Accepts]: Start accepts. Operand has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,099 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:57,099 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:57,099 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,115 INFO L130 PetriNetUnfolder]: 45/142 cut-off events. [2022-12-05 22:54:57,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:54:57,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 142 events. 45/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 598 event pairs, 23 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 225. Up to 76 conditions per place. [2022-12-05 22:54:57,117 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,117 INFO L188 LiptonReduction]: Number of co-enabled transitions 376 [2022-12-05 22:54:57,127 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:57,128 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-05 22:54:57,128 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 93 flow [2022-12-05 22:54:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 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-05 22:54:57,128 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:57,128 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:57,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:54:57,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:57,129 INFO L85 PathProgramCache]: Analyzing trace with hash 860595841, now seen corresponding path program 1 times [2022-12-05 22:54:57,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661709753] [2022-12-05 22:54:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:57,322 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-05 22:54:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:57,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661709753] [2022-12-05 22:54:57,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661709753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:57,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:57,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836617366] [2022-12-05 22:54:57,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:57,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:57,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:57,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:57,328 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:54:57,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 93 flow. Second operand has 4 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-05 22:54:57,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:57,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:54:57,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:58,019 INFO L130 PetriNetUnfolder]: 5445/7414 cut-off events. [2022-12-05 22:54:58,019 INFO L131 PetriNetUnfolder]: For 1355/1355 co-relation queries the response was YES. [2022-12-05 22:54:58,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17097 conditions, 7414 events. 5445/7414 cut-off events. For 1355/1355 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 31634 event pairs, 1695 based on Foata normal form. 144/7558 useless extension candidates. Maximal degree in co-relation 17086. Up to 5105 conditions per place. [2022-12-05 22:54:58,057 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 39 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2022-12-05 22:54:58,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 207 flow [2022-12-05 22:54:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:58,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-05 22:54:58,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-05 22:54:58,059 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 93 flow. Second operand 3 states and 39 transitions. [2022-12-05 22:54:58,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 207 flow [2022-12-05 22:54:58,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:54:58,060 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,061 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2022-12-05 22:54:58,061 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-05 22:54:58,061 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:58,062 INFO L89 Accepts]: Start accepts. Operand has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,062 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:58,062 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:58,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,074 INFO L130 PetriNetUnfolder]: 29/93 cut-off events. [2022-12-05 22:54:58,074 INFO L131 PetriNetUnfolder]: For 13/19 co-relation queries the response was YES. [2022-12-05 22:54:58,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 93 events. 29/93 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 348 event pairs, 11 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 173. Up to 53 conditions per place. [2022-12-05 22:54:58,075 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,075 INFO L188 LiptonReduction]: Number of co-enabled transitions 374 [2022-12-05 22:54:58,077 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:58,078 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-05 22:54:58,078 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 99 flow [2022-12-05 22:54:58,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-05 22:54:58,078 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:58,079 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:58,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:54:58,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:58,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:58,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1347581064, now seen corresponding path program 1 times [2022-12-05 22:54:58,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:58,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964362708] [2022-12-05 22:54:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:58,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:58,277 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-05 22:54:58,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:58,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964362708] [2022-12-05 22:54:58,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964362708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:58,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:58,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:54:58,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164540313] [2022-12-05 22:54:58,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:58,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:58,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:58,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:58,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:58,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-05 22:54:58,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 99 flow. Second operand has 4 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-05 22:54:58,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:58,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-05 22:54:58,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:58,946 INFO L130 PetriNetUnfolder]: 5029/6870 cut-off events. [2022-12-05 22:54:58,947 INFO L131 PetriNetUnfolder]: For 2166/2166 co-relation queries the response was YES. [2022-12-05 22:54:58,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16297 conditions, 6870 events. 5029/6870 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 30193 event pairs, 2067 based on Foata normal form. 128/6998 useless extension candidates. Maximal degree in co-relation 16284. Up to 4611 conditions per place. [2022-12-05 22:54:58,980 INFO L137 encePairwiseOnDemand]: 23/26 looper letters, 44 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2022-12-05 22:54:58,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 240 flow [2022-12-05 22:54:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:54:58,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:54:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-05 22:54:58,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-05 22:54:58,982 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 99 flow. Second operand 3 states and 44 transitions. [2022-12-05 22:54:58,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 240 flow [2022-12-05 22:54:58,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 47 transitions, 232 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:58,985 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:58,985 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-12-05 22:54:58,986 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2022-12-05 22:54:58,986 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:58,986 INFO L89 Accepts]: Start accepts. Operand has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:58,987 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:58,987 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:58,987 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:58,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:58,996 INFO L130 PetriNetUnfolder]: 21/81 cut-off events. [2022-12-05 22:54:58,996 INFO L131 PetriNetUnfolder]: For 17/25 co-relation queries the response was YES. [2022-12-05 22:54:58,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 81 events. 21/81 cut-off events. For 17/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 291 event pairs, 8 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 157. Up to 41 conditions per place. [2022-12-05 22:54:58,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:58,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 372 [2022-12-05 22:54:58,999 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:54:59,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-05 22:54:59,000 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 104 flow [2022-12-05 22:54:59,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-05 22:54:59,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:59,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:59,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:54:59,001 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:59,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:59,002 INFO L85 PathProgramCache]: Analyzing trace with hash 372910029, now seen corresponding path program 1 times [2022-12-05 22:54:59,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:59,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201574756] [2022-12-05 22:54:59,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:59,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:59,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:59,198 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-05 22:54:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:59,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201574756] [2022-12-05 22:54:59,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201574756] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:59,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:59,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:54:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799225509] [2022-12-05 22:54:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:54:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:54:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:54:59,200 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 22:54:59,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-05 22:54:59,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:59,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 22:54:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:54:59,611 INFO L130 PetriNetUnfolder]: 2519/3780 cut-off events. [2022-12-05 22:54:59,611 INFO L131 PetriNetUnfolder]: For 890/908 co-relation queries the response was YES. [2022-12-05 22:54:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8722 conditions, 3780 events. 2519/3780 cut-off events. For 890/908 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 20246 event pairs, 501 based on Foata normal form. 296/3970 useless extension candidates. Maximal degree in co-relation 8708. Up to 2462 conditions per place. [2022-12-05 22:54:59,629 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 55 selfloop transitions, 9 changer transitions 2/72 dead transitions. [2022-12-05 22:54:59,630 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 346 flow [2022-12-05 22:54:59,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:54:59,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:54:59,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-05 22:54:59,631 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2022-12-05 22:54:59,631 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 104 flow. Second operand 5 states and 84 transitions. [2022-12-05 22:54:59,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 346 flow [2022-12-05 22:54:59,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:54:59,634 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 167 flow [2022-12-05 22:54:59,634 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-12-05 22:54:59,634 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-12-05 22:54:59,634 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:54:59,635 INFO L89 Accepts]: Start accepts. Operand has 46 places, 38 transitions, 167 flow [2022-12-05 22:54:59,635 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:54:59,635 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:54:59,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 167 flow [2022-12-05 22:54:59,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 167 flow [2022-12-05 22:54:59,669 INFO L130 PetriNetUnfolder]: 224/454 cut-off events. [2022-12-05 22:54:59,669 INFO L131 PetriNetUnfolder]: For 297/352 co-relation queries the response was YES. [2022-12-05 22:54:59,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1282 conditions, 454 events. 224/454 cut-off events. For 297/352 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2529 event pairs, 107 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1268. Up to 305 conditions per place. [2022-12-05 22:54:59,674 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 167 flow [2022-12-05 22:54:59,674 INFO L188 LiptonReduction]: Number of co-enabled transitions 492 [2022-12-05 22:54:59,761 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:54:59,762 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 128 [2022-12-05 22:54:59,762 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 161 flow [2022-12-05 22:54:59,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-05 22:54:59,762 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:54:59,762 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:54:59,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:54:59,763 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:54:59,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:54:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 578652466, now seen corresponding path program 1 times [2022-12-05 22:54:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:54:59,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844122243] [2022-12-05 22:54:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:54:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:54:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:54:59,974 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-05 22:54:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:54:59,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844122243] [2022-12-05 22:54:59,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844122243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:54:59,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:54:59,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:54:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546612715] [2022-12-05 22:54:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:54:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:54:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:54:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:54:59,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:54:59,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 26 [2022-12-05 22:54:59,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-05 22:54:59,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:54:59,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 26 [2022-12-05 22:54:59,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:00,303 INFO L130 PetriNetUnfolder]: 1490/2356 cut-off events. [2022-12-05 22:55:00,303 INFO L131 PetriNetUnfolder]: For 1430/1557 co-relation queries the response was YES. [2022-12-05 22:55:00,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7261 conditions, 2356 events. 1490/2356 cut-off events. For 1430/1557 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12197 event pairs, 246 based on Foata normal form. 229/2520 useless extension candidates. Maximal degree in co-relation 7244. Up to 944 conditions per place. [2022-12-05 22:55:00,316 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 64 selfloop transitions, 13 changer transitions 2/85 dead transitions. [2022-12-05 22:55:00,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 483 flow [2022-12-05 22:55:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:55:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:55:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-05 22:55:00,318 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2022-12-05 22:55:00,318 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 161 flow. Second operand 6 states and 103 transitions. [2022-12-05 22:55:00,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 483 flow [2022-12-05 22:55:00,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 85 transitions, 476 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 22:55:00,327 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 246 flow [2022-12-05 22:55:00,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2022-12-05 22:55:00,328 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2022-12-05 22:55:00,328 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:00,328 INFO L89 Accepts]: Start accepts. Operand has 50 places, 42 transitions, 246 flow [2022-12-05 22:55:00,330 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:00,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:00,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 42 transitions, 246 flow [2022-12-05 22:55:00,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 42 transitions, 246 flow [2022-12-05 22:55:00,357 INFO L130 PetriNetUnfolder]: 140/327 cut-off events. [2022-12-05 22:55:00,358 INFO L131 PetriNetUnfolder]: For 602/695 co-relation queries the response was YES. [2022-12-05 22:55:00,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 327 events. 140/327 cut-off events. For 602/695 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1710 event pairs, 32 based on Foata normal form. 11/322 useless extension candidates. Maximal degree in co-relation 1305. Up to 225 conditions per place. [2022-12-05 22:55:00,362 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 42 transitions, 246 flow [2022-12-05 22:55:00,362 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-05 22:55:00,366 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L878-3-->L882: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33| (mod v_~main$tmp_guard0~0_42 256)) (= v_~main$tmp_guard0~0_42 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [477] L806-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_79 (+ v_~__unbuffered_cnt~0_80 1)) (= |v_P2Thread1of1ForFork0_#res.offset_7| 0) (= |v_P2Thread1of1ForFork0_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] [2022-12-05 22:55:00,397 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L878-3-->L882: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33| (mod v_~main$tmp_guard0~0_42 256)) (= v_~main$tmp_guard0~0_42 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [503] L778-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork3_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_151 (+ v_~__unbuffered_cnt~0_152 1)) (= |v_P1Thread1of1ForFork3_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_152} OutVars{P1Thread1of1ForFork3_#res.base=|v_P1Thread1of1ForFork3_#res.base_7|, P1Thread1of1ForFork3_#res.offset=|v_P1Thread1of1ForFork3_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_151} AuxVars[] AssignedVars[P1Thread1of1ForFork3_#res.base, P1Thread1of1ForFork3_#res.offset, ~__unbuffered_cnt~0] [2022-12-05 22:55:00,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [524] L878-3-->L882: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33| (mod v_~main$tmp_guard0~0_42 256)) (= v_~main$tmp_guard0~0_42 (ite (= (ite (= v_~__unbuffered_cnt~0_159 4) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_33|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_41|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet14#1] and [496] L854-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#res#1.offset_13| 0) (= v_~__unbuffered_cnt~0_125 (+ v_~__unbuffered_cnt~0_126 1)) (= |v_P3Thread1of1ForFork2_#res#1.base_13| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_13|, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_125} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, P3Thread1of1ForFork2_#res#1.offset, ~__unbuffered_cnt~0] [2022-12-05 22:55:00,463 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:55:00,464 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 136 [2022-12-05 22:55:00,464 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 250 flow [2022-12-05 22:55:00,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-05 22:55:00,464 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:00,465 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:00,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:55:00,465 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:00,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1626405798, now seen corresponding path program 1 times [2022-12-05 22:55:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:00,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601518471] [2022-12-05 22:55:00,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:00,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:00,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:00,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601518471] [2022-12-05 22:55:00,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601518471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:00,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:00,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:55:00,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259240920] [2022-12-05 22:55:00,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:00,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:55:00,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:00,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:55:00,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:55:00,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2022-12-05 22:55:00,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:00,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:00,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2022-12-05 22:55:00,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:01,002 INFO L130 PetriNetUnfolder]: 1067/1727 cut-off events. [2022-12-05 22:55:01,003 INFO L131 PetriNetUnfolder]: For 3299/3625 co-relation queries the response was YES. [2022-12-05 22:55:01,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6539 conditions, 1727 events. 1067/1727 cut-off events. For 3299/3625 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8727 event pairs, 199 based on Foata normal form. 129/1799 useless extension candidates. Maximal degree in co-relation 6519. Up to 717 conditions per place. [2022-12-05 22:55:01,013 INFO L137 encePairwiseOnDemand]: 19/29 looper letters, 64 selfloop transitions, 20 changer transitions 11/101 dead transitions. [2022-12-05 22:55:01,013 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 697 flow [2022-12-05 22:55:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 22:55:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 22:55:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-12-05 22:55:01,015 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6059113300492611 [2022-12-05 22:55:01,015 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 250 flow. Second operand 7 states and 123 transitions. [2022-12-05 22:55:01,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 697 flow [2022-12-05 22:55:01,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 619 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:01,034 INFO L231 Difference]: Finished difference. Result has 55 places, 49 transitions, 333 flow [2022-12-05 22:55:01,034 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=55, PETRI_TRANSITIONS=49} [2022-12-05 22:55:01,034 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 12 predicate places. [2022-12-05 22:55:01,035 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:01,035 INFO L89 Accepts]: Start accepts. Operand has 55 places, 49 transitions, 333 flow [2022-12-05 22:55:01,036 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:01,036 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:01,036 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 49 transitions, 333 flow [2022-12-05 22:55:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 49 transitions, 333 flow [2022-12-05 22:55:01,063 INFO L130 PetriNetUnfolder]: 90/242 cut-off events. [2022-12-05 22:55:01,063 INFO L131 PetriNetUnfolder]: For 701/714 co-relation queries the response was YES. [2022-12-05 22:55:01,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1011 conditions, 242 events. 90/242 cut-off events. For 701/714 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1203 event pairs, 9 based on Foata normal form. 2/232 useless extension candidates. Maximal degree in co-relation 992. Up to 155 conditions per place. [2022-12-05 22:55:01,066 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 49 transitions, 333 flow [2022-12-05 22:55:01,066 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-05 22:55:01,106 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:55:01,107 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 72 [2022-12-05 22:55:01,107 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 323 flow [2022-12-05 22:55:01,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:01,107 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:01,107 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:01,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:55:01,108 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1797790350, now seen corresponding path program 1 times [2022-12-05 22:55:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:01,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729823465] [2022-12-05 22:55:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:01,296 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-05 22:55:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729823465] [2022-12-05 22:55:01,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729823465] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:55:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874379898] [2022-12-05 22:55:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:01,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:55:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:55:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:55:01,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2022-12-05 22:55:01,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-05 22:55:01,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:01,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2022-12-05 22:55:01,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:01,615 INFO L130 PetriNetUnfolder]: 1533/2469 cut-off events. [2022-12-05 22:55:01,616 INFO L131 PetriNetUnfolder]: For 5232/5233 co-relation queries the response was YES. [2022-12-05 22:55:01,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8736 conditions, 2469 events. 1533/2469 cut-off events. For 5232/5233 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12866 event pairs, 193 based on Foata normal form. 9/2438 useless extension candidates. Maximal degree in co-relation 8714. Up to 1321 conditions per place. [2022-12-05 22:55:01,632 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 89 selfloop transitions, 2 changer transitions 8/104 dead transitions. [2022-12-05 22:55:01,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 951 flow [2022-12-05 22:55:01,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:55:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:55:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-12-05 22:55:01,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6120689655172413 [2022-12-05 22:55:01,634 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 323 flow. Second operand 4 states and 71 transitions. [2022-12-05 22:55:01,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 951 flow [2022-12-05 22:55:01,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 781 flow, removed 60 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:01,662 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 273 flow [2022-12-05 22:55:01,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2022-12-05 22:55:01,663 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 14 predicate places. [2022-12-05 22:55:01,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:01,663 INFO L89 Accepts]: Start accepts. Operand has 57 places, 49 transitions, 273 flow [2022-12-05 22:55:01,664 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:01,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:01,664 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 49 transitions, 273 flow [2022-12-05 22:55:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 49 transitions, 273 flow [2022-12-05 22:55:01,691 INFO L130 PetriNetUnfolder]: 135/334 cut-off events. [2022-12-05 22:55:01,692 INFO L131 PetriNetUnfolder]: For 660/668 co-relation queries the response was YES. [2022-12-05 22:55:01,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 334 events. 135/334 cut-off events. For 660/668 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1790 event pairs, 13 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 1139. Up to 149 conditions per place. [2022-12-05 22:55:01,695 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 49 transitions, 273 flow [2022-12-05 22:55:01,695 INFO L188 LiptonReduction]: Number of co-enabled transitions 610 [2022-12-05 22:55:01,889 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:55:01,890 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 227 [2022-12-05 22:55:01,890 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 276 flow [2022-12-05 22:55:01,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-05 22:55:01,891 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:01,891 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:01,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:55:01,891 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2138200196, now seen corresponding path program 2 times [2022-12-05 22:55:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:01,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515676609] [2022-12-05 22:55:01,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:01,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:02,140 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-05 22:55:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:02,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515676609] [2022-12-05 22:55:02,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515676609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:02,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:02,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 22:55:02,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758223799] [2022-12-05 22:55:02,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:02,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 22:55:02,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:02,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 22:55:02,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 22:55:02,142 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-05 22:55:02,143 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 276 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:02,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:02,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-05 22:55:02,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:02,486 INFO L130 PetriNetUnfolder]: 1300/2095 cut-off events. [2022-12-05 22:55:02,486 INFO L131 PetriNetUnfolder]: For 3110/3203 co-relation queries the response was YES. [2022-12-05 22:55:02,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 2095 events. 1300/2095 cut-off events. For 3110/3203 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11035 event pairs, 196 based on Foata normal form. 76/2076 useless extension candidates. Maximal degree in co-relation 7146. Up to 678 conditions per place. [2022-12-05 22:55:02,496 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 57 selfloop transitions, 24 changer transitions 13/101 dead transitions. [2022-12-05 22:55:02,497 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 660 flow [2022-12-05 22:55:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 22:55:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 22:55:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2022-12-05 22:55:02,498 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2022-12-05 22:55:02,498 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 276 flow. Second operand 9 states and 131 transitions. [2022-12-05 22:55:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 660 flow [2022-12-05 22:55:02,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 101 transitions, 620 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:02,526 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 323 flow [2022-12-05 22:55:02,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=323, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2022-12-05 22:55:02,526 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2022-12-05 22:55:02,527 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:02,527 INFO L89 Accepts]: Start accepts. Operand has 65 places, 49 transitions, 323 flow [2022-12-05 22:55:02,528 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:02,528 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:02,528 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 49 transitions, 323 flow [2022-12-05 22:55:02,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 49 transitions, 323 flow [2022-12-05 22:55:02,552 INFO L130 PetriNetUnfolder]: 114/285 cut-off events. [2022-12-05 22:55:02,552 INFO L131 PetriNetUnfolder]: For 769/813 co-relation queries the response was YES. [2022-12-05 22:55:02,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 285 events. 114/285 cut-off events. For 769/813 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1530 event pairs, 8 based on Foata normal form. 2/259 useless extension candidates. Maximal degree in co-relation 1145. Up to 129 conditions per place. [2022-12-05 22:55:02,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 49 transitions, 323 flow [2022-12-05 22:55:02,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 562 [2022-12-05 22:55:02,951 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:55:02,951 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 424 [2022-12-05 22:55:02,952 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 271 flow [2022-12-05 22:55:02,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:02,952 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:02,952 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:02,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:55:02,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1486022817, now seen corresponding path program 1 times [2022-12-05 22:55:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:02,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293871953] [2022-12-05 22:55:02,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:03,144 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-05 22:55:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293871953] [2022-12-05 22:55:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293871953] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:03,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:55:03,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051756760] [2022-12-05 22:55:03,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:55:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:03,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:55:03,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:55:03,146 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-05 22:55:03,146 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 271 flow. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:03,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:03,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-05 22:55:03,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:03,601 INFO L130 PetriNetUnfolder]: 2357/3575 cut-off events. [2022-12-05 22:55:03,601 INFO L131 PetriNetUnfolder]: For 5681/5681 co-relation queries the response was YES. [2022-12-05 22:55:03,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12581 conditions, 3575 events. 2357/3575 cut-off events. For 5681/5681 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 17944 event pairs, 311 based on Foata normal form. 1/3576 useless extension candidates. Maximal degree in co-relation 12556. Up to 2043 conditions per place. [2022-12-05 22:55:03,614 INFO L137 encePairwiseOnDemand]: 18/24 looper letters, 54 selfloop transitions, 4 changer transitions 51/109 dead transitions. [2022-12-05 22:55:03,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 109 transitions, 815 flow [2022-12-05 22:55:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:55:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:55:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-12-05 22:55:03,616 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2022-12-05 22:55:03,616 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 271 flow. Second operand 6 states and 78 transitions. [2022-12-05 22:55:03,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 109 transitions, 815 flow [2022-12-05 22:55:03,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 676 flow, removed 31 selfloop flow, removed 10 redundant places. [2022-12-05 22:55:03,653 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 183 flow [2022-12-05 22:55:03,653 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=183, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-05 22:55:03,654 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2022-12-05 22:55:03,654 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:03,654 INFO L89 Accepts]: Start accepts. Operand has 54 places, 38 transitions, 183 flow [2022-12-05 22:55:03,656 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:03,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:03,656 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 183 flow [2022-12-05 22:55:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 38 transitions, 183 flow [2022-12-05 22:55:03,668 INFO L130 PetriNetUnfolder]: 47/128 cut-off events. [2022-12-05 22:55:03,668 INFO L131 PetriNetUnfolder]: For 100/104 co-relation queries the response was YES. [2022-12-05 22:55:03,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 128 events. 47/128 cut-off events. For 100/104 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 492 event pairs, 7 based on Foata normal form. 1/121 useless extension candidates. Maximal degree in co-relation 331. Up to 40 conditions per place. [2022-12-05 22:55:03,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 38 transitions, 183 flow [2022-12-05 22:55:03,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 362 [2022-12-05 22:55:04,037 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:55:04,038 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 384 [2022-12-05 22:55:04,039 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 179 flow [2022-12-05 22:55:04,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:04,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:04,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:04,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:55:04,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:04,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:04,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1773741058, now seen corresponding path program 1 times [2022-12-05 22:55:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:04,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231465266] [2022-12-05 22:55:04,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:04,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:55:04,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:04,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231465266] [2022-12-05 22:55:04,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231465266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:04,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:04,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:55:04,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265187225] [2022-12-05 22:55:04,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:04,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:55:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:04,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:55:04,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:55:04,249 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-05 22:55:04,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 179 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:04,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:04,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-05 22:55:04,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:04,468 INFO L130 PetriNetUnfolder]: 651/1085 cut-off events. [2022-12-05 22:55:04,469 INFO L131 PetriNetUnfolder]: For 1702/1702 co-relation queries the response was YES. [2022-12-05 22:55:04,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1085 events. 651/1085 cut-off events. For 1702/1702 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4863 event pairs, 172 based on Foata normal form. 1/1086 useless extension candidates. Maximal degree in co-relation 3760. Up to 676 conditions per place. [2022-12-05 22:55:04,472 INFO L137 encePairwiseOnDemand]: 16/22 looper letters, 33 selfloop transitions, 3 changer transitions 51/87 dead transitions. [2022-12-05 22:55:04,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 87 transitions, 589 flow [2022-12-05 22:55:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:55:04,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:55:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-05 22:55:04,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2022-12-05 22:55:04,473 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 179 flow. Second operand 6 states and 58 transitions. [2022-12-05 22:55:04,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 87 transitions, 589 flow [2022-12-05 22:55:04,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 581 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-05 22:55:04,480 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 174 flow [2022-12-05 22:55:04,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2022-12-05 22:55:04,480 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2022-12-05 22:55:04,480 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:04,480 INFO L89 Accepts]: Start accepts. Operand has 53 places, 34 transitions, 174 flow [2022-12-05 22:55:04,483 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:04,483 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:04,483 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 34 transitions, 174 flow [2022-12-05 22:55:04,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 34 transitions, 174 flow [2022-12-05 22:55:04,492 INFO L130 PetriNetUnfolder]: 44/120 cut-off events. [2022-12-05 22:55:04,492 INFO L131 PetriNetUnfolder]: For 117/119 co-relation queries the response was YES. [2022-12-05 22:55:04,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 120 events. 44/120 cut-off events. For 117/119 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 473 event pairs, 5 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 339. Up to 42 conditions per place. [2022-12-05 22:55:04,493 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 34 transitions, 174 flow [2022-12-05 22:55:04,493 INFO L188 LiptonReduction]: Number of co-enabled transitions 118 [2022-12-05 22:55:05,094 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:55:05,095 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 615 [2022-12-05 22:55:05,095 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 166 flow [2022-12-05 22:55:05,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:55:05,095 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:05,095 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:05,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:55:05,095 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:05,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:05,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1243552030, now seen corresponding path program 1 times [2022-12-05 22:55:05,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:05,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357242484] [2022-12-05 22:55:05,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:05,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:55:06,027 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-05 22:55:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:55:06,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357242484] [2022-12-05 22:55:06,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357242484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:55:06,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:55:06,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:55:06,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289697423] [2022-12-05 22:55:06,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:55:06,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:55:06,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:55:06,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:55:06,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:55:06,030 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-05 22:55:06,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 166 flow. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-05 22:55:06,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:55:06,031 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-05 22:55:06,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:55:06,143 INFO L130 PetriNetUnfolder]: 128/254 cut-off events. [2022-12-05 22:55:06,144 INFO L131 PetriNetUnfolder]: For 545/545 co-relation queries the response was YES. [2022-12-05 22:55:06,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 989 conditions, 254 events. 128/254 cut-off events. For 545/545 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1066 event pairs, 8 based on Foata normal form. 1/255 useless extension candidates. Maximal degree in co-relation 969. Up to 120 conditions per place. [2022-12-05 22:55:06,145 INFO L137 encePairwiseOnDemand]: 13/18 looper letters, 35 selfloop transitions, 4 changer transitions 20/59 dead transitions. [2022-12-05 22:55:06,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 459 flow [2022-12-05 22:55:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:55:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:55:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-12-05 22:55:06,146 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2022-12-05 22:55:06,146 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 166 flow. Second operand 6 states and 30 transitions. [2022-12-05 22:55:06,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 459 flow [2022-12-05 22:55:06,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 448 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-05 22:55:06,148 INFO L231 Difference]: Finished difference. Result has 49 places, 30 transitions, 169 flow [2022-12-05 22:55:06,148 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=49, PETRI_TRANSITIONS=30} [2022-12-05 22:55:06,150 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2022-12-05 22:55:06,150 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:55:06,150 INFO L89 Accepts]: Start accepts. Operand has 49 places, 30 transitions, 169 flow [2022-12-05 22:55:06,150 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:55:06,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:55:06,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 30 transitions, 169 flow [2022-12-05 22:55:06,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 30 transitions, 169 flow [2022-12-05 22:55:06,159 INFO L130 PetriNetUnfolder]: 34/92 cut-off events. [2022-12-05 22:55:06,159 INFO L131 PetriNetUnfolder]: For 109/113 co-relation queries the response was YES. [2022-12-05 22:55:06,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 92 events. 34/92 cut-off events. For 109/113 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 342 event pairs, 1 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 269. Up to 34 conditions per place. [2022-12-05 22:55:06,159 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 30 transitions, 169 flow [2022-12-05 22:55:06,159 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-05 22:55:06,589 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] L847-->P3EXIT: Formula: (let ((.cse3 (not (= (mod v_~z$r_buff1_thd4~0_196 256) 0))) (.cse5 (not (= 0 (mod v_~z$r_buff0_thd4~0_229 256)))) (.cse4 (not (= (mod v_~z$w_buff0_used~0_424 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_425 256) 0)))) (.cse2 (and (not (= (mod v_~z$w_buff1_used~0_381 256) 0)) .cse3))) (and (= |v_P3Thread1of1ForFork2_#res#1.base_39| 0) (= v_~z$w_buff0_used~0_424 (ite .cse0 0 v_~z$w_buff0_used~0_425)) (= v_~z$r_buff0_thd4~0_228 (ite .cse1 0 v_~z$r_buff0_thd4~0_229)) (= |v_P3Thread1of1ForFork2_#res#1.offset_39| 0) (= v_~z$w_buff1_used~0_380 (ite (or .cse2 .cse1) 0 v_~z$w_buff1_used~0_381)) (= v_~__unbuffered_cnt~0_303 (+ v_~__unbuffered_cnt~0_304 1)) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_380 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_228 256) 0)))) 0 v_~z$r_buff1_thd4~0_196) v_~z$r_buff1_thd4~0_195) (= v_~z~0_349 (ite .cse0 v_~z$w_buff0~0_278 (ite .cse2 v_~z$w_buff1~0_254 v_~z~0_350)))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_196, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_425, ~z$w_buff0~0=v_~z$w_buff0~0_278, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_229, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_381, ~z$w_buff1~0=v_~z$w_buff1~0_254, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_304, ~z~0=v_~z~0_350} OutVars{P3Thread1of1ForFork2_#res#1.base=|v_P3Thread1of1ForFork2_#res#1.base_39|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_195, P3Thread1of1ForFork2_#res#1.offset=|v_P3Thread1of1ForFork2_#res#1.offset_39|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_424, ~z$w_buff0~0=v_~z$w_buff0~0_278, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_228, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_380, ~z$w_buff1~0=v_~z$w_buff1~0_254, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_303, ~z~0=v_~z~0_349} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#res#1.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res#1.offset, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~__unbuffered_cnt~0, ~z~0] and [537] L878-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_380 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd0~0_151 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd0~0_149 256) 0)))) (let ((.cse0 (and (not (= (mod v_~z$w_buff0_used~0_381 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~z$w_buff1_used~0_340 256) 0)) .cse3)) (.cse2 (and .cse5 .cse4))) (and (= v_~z~0_309 (ite .cse0 v_~z$w_buff0~0_244 (ite .cse1 v_~z$w_buff1~0_223 v_~z~0_310))) (= (ite (= (ite (not (and (= v_~__unbuffered_p0_EAX~0_82 0) (= v_~__unbuffered_p3_EAX~0_93 1) (= v_~__unbuffered_p1_EAX~0_74 1) (= 0 v_~__unbuffered_p3_EBX~0_77) (= v_~__unbuffered_p2_EAX~0_114 0) (= v_~__unbuffered_p1_EBX~0_79 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_70) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57| 0) (= (ite .cse0 0 v_~z$w_buff0_used~0_381) v_~z$w_buff0_used~0_380) (= v_~z$w_buff1_used~0_339 (ite (or .cse1 .cse2) 0 v_~z$w_buff1_used~0_340)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_293 4) 1 0) 0) 0 1) v_~main$tmp_guard0~0_76) (= (mod v_~main$tmp_guard1~0_70 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|) (= (mod v_~main$tmp_guard0~0_76 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|) (= v_~z$r_buff1_thd0~0_150 (ite (or (and .cse3 (not (= (mod v_~z$w_buff1_used~0_339 256) 0))) (and (not (= (mod v_~z$r_buff0_thd0~0_148 256) 0)) .cse4)) 0 v_~z$r_buff1_thd0~0_151)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_61| 0)) (= v_~z$r_buff0_thd0~0_148 (ite .cse2 0 v_~z$r_buff0_thd0~0_149))))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_381, ~z$w_buff0~0=v_~z$w_buff0~0_244, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ~z$w_buff1~0=v_~z$w_buff1~0_223, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_77, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_149, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_151, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_293, ~z~0=v_~z~0_310} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_57|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_61|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_79, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_380, ~z$w_buff0~0=v_~z$w_buff0~0_244, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_339, ~z$w_buff1~0=v_~z$w_buff1~0_223, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_70, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_77, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_76, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_73|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_74, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_150, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_61|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_93, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_293, ~z~0=v_~z~0_309, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_81|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~pre13#1, ~z$w_buff0_used~0, ~z$w_buff1_used~0, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet14#1, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~z$r_buff1_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~z~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-05 22:55:07,034 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:55:07,035 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 885 [2022-12-05 22:55:07,035 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 185 flow [2022-12-05 22:55:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 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-05 22:55:07,035 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:55:07,035 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:07,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:55:07,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 22:55:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:55:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1732364577, now seen corresponding path program 1 times [2022-12-05 22:55:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:55:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106255897] [2022-12-05 22:55:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:55:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:55:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:55:07,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:55:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:55:07,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:55:07,186 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:55:07,187 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 22:55:07,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 22:55:07,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 22:55:07,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 22:55:07,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 22:55:07,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 22:55:07,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 22:55:07,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 22:55:07,189 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:55:07,193 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:55:07,194 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:55:07,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:55:07 BasicIcfg [2022-12-05 22:55:07,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:55:07,251 INFO L158 Benchmark]: Toolchain (without parser) took 19226.10ms. Allocated memory was 169.9MB in the beginning and 702.5MB in the end (delta: 532.7MB). Free memory was 143.5MB in the beginning and 407.7MB in the end (delta: -264.2MB). Peak memory consumption was 267.9MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,252 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:55:07,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.45ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 114.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.38ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,252 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,252 INFO L158 Benchmark]: RCFGBuilder took 691.26ms. Allocated memory is still 169.9MB. Free memory was 109.9MB in the beginning and 124.8MB in the end (delta: -14.9MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,253 INFO L158 Benchmark]: TraceAbstraction took 17969.58ms. Allocated memory was 169.9MB in the beginning and 702.5MB in the end (delta: 532.7MB). Free memory was 124.3MB in the beginning and 407.7MB in the end (delta: -283.4MB). Peak memory consumption was 249.3MB. Max. memory is 8.0GB. [2022-12-05 22:55:07,254 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 169.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 484.45ms. Allocated memory is still 169.9MB. Free memory was 143.5MB in the beginning and 114.7MB in the end (delta: 28.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.38ms. Allocated memory is still 169.9MB. Free memory was 114.7MB in the beginning and 112.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 169.9MB. Free memory was 112.0MB in the beginning and 109.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 691.26ms. Allocated memory is still 169.9MB. Free memory was 109.9MB in the beginning and 124.8MB in the end (delta: -14.9MB). Peak memory consumption was 21.8MB. Max. memory is 8.0GB. * TraceAbstraction took 17969.58ms. Allocated memory was 169.9MB in the beginning and 702.5MB in the end (delta: 532.7MB). Free memory was 124.3MB in the beginning and 407.7MB in the end (delta: -283.4MB). Peak memory consumption was 249.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.2s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 2850 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 45 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2066, independent: 2003, independent conditional: 2003, independent unconditional: 0, dependent: 63, dependent conditional: 63, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2066, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2066, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2066, independent: 2003, independent conditional: 0, independent unconditional: 2003, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1668, independent: 1621, independent conditional: 0, independent unconditional: 1621, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1668, independent: 1598, independent conditional: 0, independent unconditional: 1598, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2066, independent: 382, independent conditional: 0, independent unconditional: 382, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1668, unknown conditional: 0, unknown unconditional: 1668] , Statistics on independence cache: Total cache size (in pairs): 2453, Positive cache size: 2406, Positive conditional cache size: 0, Positive unconditional cache size: 2406, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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, 37 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 336 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 211, independent: 185, independent conditional: 185, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 211, independent: 185, independent conditional: 13, independent unconditional: 172, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 211, independent: 185, independent conditional: 13, independent unconditional: 172, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 211, independent: 185, independent conditional: 13, independent unconditional: 172, dependent: 26, dependent conditional: 3, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 184, independent: 163, independent conditional: 11, independent unconditional: 152, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 184, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 100, dependent conditional: 13, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 211, independent: 22, independent conditional: 2, independent unconditional: 20, dependent: 5, dependent conditional: 1, dependent unconditional: 4, unknown: 184, unknown conditional: 13, unknown unconditional: 171] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 163, Positive conditional cache size: 11, Positive unconditional cache size: 152, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 160, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 19, independent unconditional: 141, dependent: 19, dependent conditional: 6, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 179, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 179, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 9, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 179, independent: 152, independent conditional: 0, independent unconditional: 152, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 193, Positive cache size: 171, Positive conditional cache size: 11, Positive unconditional cache size: 160, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 374 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 157, independent conditional: 157, 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: 177, independent: 157, independent conditional: 19, independent unconditional: 138, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 178, Positive conditional cache size: 11, Positive unconditional cache size: 167, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 25, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 372 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 177, independent: 157, independent conditional: 157, 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: 177, independent: 157, independent conditional: 30, independent unconditional: 127, dependent: 20, dependent conditional: 6, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 177, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 178, Positive conditional cache size: 11, Positive unconditional cache size: 167, Negative cache size: 22, Negative conditional cache size: 2, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 185, independent conditional: 185, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 219, independent: 185, independent conditional: 69, independent unconditional: 116, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 185, independent conditional: 49, independent unconditional: 136, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 219, independent: 185, independent conditional: 49, independent unconditional: 136, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 6, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 219, independent: 177, independent conditional: 43, independent unconditional: 134, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 12, unknown conditional: 6, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 186, Positive conditional cache size: 17, Positive unconditional cache size: 169, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 50 PlacesBefore, 49 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 314, independent: 270, independent conditional: 270, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 314, independent: 270, independent conditional: 108, independent unconditional: 162, dependent: 44, dependent conditional: 8, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 314, independent: 270, independent conditional: 80, independent unconditional: 190, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 314, independent: 270, independent conditional: 80, independent unconditional: 190, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 10, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 314, independent: 258, independent conditional: 70, independent unconditional: 188, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 12, unknown conditional: 10, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 209, Positive conditional cache size: 28, Positive unconditional cache size: 181, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 55 PlacesBefore, 55 PlacesAfterwards, 49 TransitionsBefore, 48 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 470, independent: 418, independent conditional: 418, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 470, independent: 418, independent conditional: 170, independent unconditional: 248, dependent: 52, dependent conditional: 8, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 470, independent: 418, independent conditional: 142, independent unconditional: 276, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 470, independent: 418, independent conditional: 142, independent unconditional: 276, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 470, independent: 408, independent conditional: 132, independent unconditional: 276, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 219, Positive conditional cache size: 38, Positive unconditional cache size: 181, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 57 PlacesBefore, 57 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 610 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 327, independent conditional: 327, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 327, independent conditional: 170, independent unconditional: 157, dependent: 34, dependent conditional: 6, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 361, independent: 327, independent conditional: 149, independent unconditional: 178, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 361, independent: 327, independent conditional: 149, independent unconditional: 178, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 4, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 9, independent conditional: 0, independent unconditional: 9, 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: 361, independent: 318, independent conditional: 145, independent unconditional: 173, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 242, Positive conditional cache size: 45, Positive unconditional cache size: 197, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 64 PlacesBefore, 61 PlacesAfterwards, 49 TransitionsBefore, 43 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 416, independent: 387, independent conditional: 387, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 416, independent: 387, independent conditional: 229, independent unconditional: 158, dependent: 29, dependent conditional: 4, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 416, independent: 387, independent conditional: 213, independent unconditional: 174, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 416, independent: 387, independent conditional: 213, independent unconditional: 174, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 35, independent: 35, independent conditional: 35, 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: 35, independent: 35, independent conditional: 0, independent unconditional: 35, 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: 416, independent: 352, independent conditional: 178, independent unconditional: 174, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 35, unknown conditional: 35, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 307, Positive cache size: 281, Positive conditional cache size: 80, Positive unconditional cache size: 201, Negative cache size: 26, Negative conditional cache size: 2, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 51 PlacesBefore, 49 PlacesAfterwards, 38 TransitionsBefore, 36 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 190, independent: 168, independent conditional: 168, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 190, independent: 168, independent conditional: 56, independent unconditional: 112, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 190, independent: 168, independent conditional: 46, independent unconditional: 122, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 190, independent: 168, independent conditional: 46, independent unconditional: 122, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 190, independent: 161, independent conditional: 46, independent unconditional: 115, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 362, Positive cache size: 333, Positive conditional cache size: 88, Positive unconditional cache size: 245, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 51 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 30 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, independent: 65, independent conditional: 65, 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: 77, independent: 65, independent conditional: 36, independent unconditional: 29, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, independent: 65, independent conditional: 36, independent unconditional: 29, 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: 77, independent: 65, independent conditional: 36, independent unconditional: 29, 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: 4, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 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: 77, independent: 61, independent conditional: 34, independent unconditional: 27, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 435, Positive cache size: 406, Positive conditional cache size: 108, Positive unconditional cache size: 298, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, 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.9s, 48 PlacesBefore, 48 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 46, 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: 46, independent: 46, independent conditional: 46, 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: 46, independent: 46, independent conditional: 46, 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: 46, independent: 46, independent conditional: 46, 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: 46, independent: 44, independent conditional: 44, 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): 483, Positive cache size: 454, Positive conditional cache size: 110, Positive unconditional cache size: 344, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-1, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=0, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=1, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=2, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 [L774] 2 __unbuffered_p1_EAX = x [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 166 locations, 7 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: 17.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 414 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1172 IncrementalHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 24 mSDtfsCounter, 1172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:55:07,277 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...