/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:29:28,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:29:28,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:29:29,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:29:29,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:29:29,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:29:29,009 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:29:29,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:29:29,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:29:29,019 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:29:29,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:29:29,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:29:29,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:29:29,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:29:29,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:29:29,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:29:29,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:29:29,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:29:29,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:29:29,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:29:29,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:29:29,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:29:29,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:29:29,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:29:29,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:29:29,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:29:29,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:29:29,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:29:29,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:29:29,044 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:29:29,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:29:29,046 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:29:29,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:29:29,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:29:29,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:29:29,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:29:29,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:29:29,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:29:29,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:29:29,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:29:29,050 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:29:29,051 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:29:29,077 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:29:29,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:29:29,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:29:29,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:29:29,079 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:29:29,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:29:29,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:29:29,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:29:29,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:29:29,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:29:29,081 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:29:29,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:29:29,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:29:29,081 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:29:29,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:29:29,082 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:29:29,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:29,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:29:29,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:29:29,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:29:29,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:29:29,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:29:29,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:29:29,425 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:29:29,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-06 06:29:30,622 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:29:30,941 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:29:30,944 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-12-06 06:29:30,972 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7573270e7/9f7072c3eed742439afce8a6568cf4a0/FLAGb2dedf5e4 [2022-12-06 06:29:30,991 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7573270e7/9f7072c3eed742439afce8a6568cf4a0 [2022-12-06 06:29:30,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:29:30,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:29:30,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:30,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:29:31,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:29:31,000 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:30" (1/1) ... [2022-12-06 06:29:31,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47302e96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31, skipping insertion in model container [2022-12-06 06:29:31,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:29:30" (1/1) ... [2022-12-06 06:29:31,007 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:29:31,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:29:31,235 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/mix051_tso.oepc.i[949,962] [2022-12-06 06:29:31,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,366 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,367 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,368 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:31,427 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:29:31,435 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/mix051_tso.oepc.i[949,962] [2022-12-06 06:29:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:29:31,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:29:31,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:29:31,520 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:29:31,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31 WrapperNode [2022-12-06 06:29:31,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:29:31,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:31,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:29:31,522 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:29:31,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,607 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-06 06:29:31,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:29:31,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:29:31,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:29:31,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:29:31,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,644 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:29:31,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:29:31,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:29:31,650 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:29:31,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (1/1) ... [2022-12-06 06:29:31,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:29:31,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:29:31,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:29:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:29:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:29:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:29:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:29:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:29:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:29:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:29:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:29:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:29:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:29:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:29:31,727 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:29:31,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:29:31,904 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:29:31,906 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:29:32,224 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:29:32,352 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:29:32,352 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:29:32,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:32 BoogieIcfgContainer [2022-12-06 06:29:32,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:29:32,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:29:32,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:29:32,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:29:32,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:29:30" (1/3) ... [2022-12-06 06:29:32,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b1e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:32, skipping insertion in model container [2022-12-06 06:29:32,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:29:31" (2/3) ... [2022-12-06 06:29:32,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b1e297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:29:32, skipping insertion in model container [2022-12-06 06:29:32,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:29:32" (3/3) ... [2022-12-06 06:29:32,363 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-12-06 06:29:32,379 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:29:32,380 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:29:32,380 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:29:32,440 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:29:32,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:29:32,539 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:29:32,539 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:32,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:29:32,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-06 06:29:32,550 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:32,552 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:32,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:32,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:32,604 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-06 06:29:32,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:32,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:29:32,609 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-06 06:29:32,609 INFO L188 LiptonReduction]: Number of co-enabled transitions 3044 [2022-12-06 06:29:37,538 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-06 06:29:37,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:29:37,567 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;@4c32a049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:29:37,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:29:37,569 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 06:29:37,569 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:37,570 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:37,570 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:29:37,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:37,587 INFO L85 PathProgramCache]: Analyzing trace with hash 515982542, now seen corresponding path program 1 times [2022-12-06 06:29:37,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:37,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826738880] [2022-12-06 06:29:37,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:37,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:37,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:37,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826738880] [2022-12-06 06:29:37,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826738880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:37,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:37,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:29:37,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200615657] [2022-12-06 06:29:37,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:37,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:37,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:37,934 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 06:29:37,936 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:37,936 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:37,936 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 06:29:37,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:38,742 INFO L130 PetriNetUnfolder]: 4863/6806 cut-off events. [2022-12-06 06:29:38,742 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:29:38,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13630 conditions, 6806 events. 4863/6806 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 34589 event pairs, 1800 based on Foata normal form. 0/6185 useless extension candidates. Maximal degree in co-relation 13618. Up to 5308 conditions per place. [2022-12-06 06:29:38,771 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 37 selfloop transitions, 2 changer transitions 8/51 dead transitions. [2022-12-06 06:29:38,771 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 214 flow [2022-12-06 06:29:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 06:29:38,780 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 06:29:38,781 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 64 transitions. [2022-12-06 06:29:38,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 214 flow [2022-12-06 06:29:38,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:29:38,787 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 66 flow [2022-12-06 06:29:38,788 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:29:38,792 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2022-12-06 06:29:38,792 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:38,793 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 66 flow [2022-12-06 06:29:38,795 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:38,795 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:38,795 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 66 flow [2022-12-06 06:29:38,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 06:29:38,808 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 06:29:38,808 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:29:38,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:29:38,809 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 06:29:38,809 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 06:29:38,857 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:38,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:29:38,859 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 06:29:38,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:38,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:38,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:38,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:29:38,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash -504039928, now seen corresponding path program 1 times [2022-12-06 06:29:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:38,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661255248] [2022-12-06 06:29:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:38,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:39,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:39,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661255248] [2022-12-06 06:29:39,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661255248] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:39,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:39,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:39,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656589399] [2022-12-06 06:29:39,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:39,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:39,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:39,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:29:39,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:39,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:39,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:29:39,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:40,475 INFO L130 PetriNetUnfolder]: 8115/10949 cut-off events. [2022-12-06 06:29:40,475 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-06 06:29:40,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22789 conditions, 10949 events. 8115/10949 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 50045 event pairs, 2102 based on Foata normal form. 81/11030 useless extension candidates. Maximal degree in co-relation 22779. Up to 10046 conditions per place. [2022-12-06 06:29:40,532 INFO L137 encePairwiseOnDemand]: 16/27 looper letters, 51 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2022-12-06 06:29:40,532 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 64 transitions, 284 flow [2022-12-06 06:29:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2022-12-06 06:29:40,535 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2022-12-06 06:29:40,535 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 4 states and 66 transitions. [2022-12-06 06:29:40,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 64 transitions, 284 flow [2022-12-06 06:29:40,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 64 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:40,538 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 148 flow [2022-12-06 06:29:40,538 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2022-12-06 06:29:40,539 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-06 06:29:40,539 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:40,539 INFO L89 Accepts]: Start accepts. Operand has 41 places, 39 transitions, 148 flow [2022-12-06 06:29:40,540 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:40,540 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:40,540 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 39 transitions, 148 flow [2022-12-06 06:29:40,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 39 transitions, 148 flow [2022-12-06 06:29:40,581 INFO L130 PetriNetUnfolder]: 256/552 cut-off events. [2022-12-06 06:29:40,582 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 06:29:40,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 552 events. 256/552 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3234 event pairs, 147 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 1150. Up to 322 conditions per place. [2022-12-06 06:29:40,586 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 39 transitions, 148 flow [2022-12-06 06:29:40,587 INFO L188 LiptonReduction]: Number of co-enabled transitions 500 [2022-12-06 06:29:40,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [384] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_107 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18) v_~x$r_buff1_thd2~0_17) (= v_~x$r_buff0_thd2~0_32 (ite .cse2 0 v_~x$r_buff0_thd2~0_33)) (= (ite .cse0 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_41 v_~x~0_76)) v_~x~0_75)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:29:40,697 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [398] L824-->L831: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_26 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_125 256) 0)))) (.cse4 (and .cse5 .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0))))) (and (= v_~x$r_buff1_thd4~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_26)) (= (ite .cse2 v_~x$w_buff0~0_58 (ite .cse3 v_~x$w_buff1~0_51 v_~x~0_90)) v_~x~0_89) (= (ite .cse4 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124) (= (ite .cse2 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:29:40,750 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [390] L801-->L804: Formula: (= v_~__unbuffered_p2_EAX~0_1 v_~z~0_1) InVars {~z~0=v_~z~0_1} OutVars{~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_1, ~z~0=v_~z~0_1} AuxVars[] AssignedVars[~__unbuffered_p2_EAX~0] [2022-12-06 06:29:40,858 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [391] L804-->L811: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_90 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_77 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_90) v_~x$w_buff0_used~0_89) (= (ite .cse0 v_~x$w_buff0~0_38 (ite .cse1 v_~x$w_buff1~0_33 v_~x~0_56)) v_~x~0_55) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_20) v_~x$r_buff0_thd3~0_19) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_77) v_~x$w_buff1_used~0_76) (= v_~x$r_buff1_thd3~0_15 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_76 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_90} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:29:40,915 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [383] L781-->L784: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] [2022-12-06 06:29:40,924 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [397] L821-->L824: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] [2022-12-06 06:29:40,934 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [449] L2-1-->L866: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_211 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd0~0_104 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd0~0_104 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_212 256) 0)) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_184 256) 0)) .cse3)) (.cse1 (and .cse5 .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_212) v_~x$w_buff0_used~0_211) (= v_~x$w_buff1_used~0_183 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_184)) (= (ite .cse0 v_~x$w_buff0~0_122 (ite .cse2 v_~x$w_buff1~0_98 v_~x~0_139)) v_~x~0_138) (= v_~x$r_buff1_thd0~0_103 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_183 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd0~0_103 256) 0)) .cse4)) 0 v_~x$r_buff1_thd0~0_104)) (= v_~x$r_buff0_thd0~0_103 (ite .cse1 0 v_~x$r_buff0_thd0~0_104))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_122, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_104, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_184, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_104, ~x~0=v_~x~0_139, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_212} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_122, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_103, ~x$w_buff1~0=v_~x$w_buff1~0_98, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_183, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_103, ~x~0=v_~x~0_138, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_211} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:29:41,000 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:41,001 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 462 [2022-12-06 06:29:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 172 flow [2022-12-06 06:29:41,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:41,001 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:41,001 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:41,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:29:41,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:41,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:41,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1191001692, now seen corresponding path program 1 times [2022-12-06 06:29:41,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:41,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055215896] [2022-12-06 06:29:41,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:41,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:41,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055215896] [2022-12-06 06:29:41,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055215896] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:41,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:41,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782804209] [2022-12-06 06:29:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:41,250 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:41,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:41,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:41,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:41,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:42,222 INFO L130 PetriNetUnfolder]: 6880/9496 cut-off events. [2022-12-06 06:29:42,222 INFO L131 PetriNetUnfolder]: For 5705/6087 co-relation queries the response was YES. [2022-12-06 06:29:42,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25307 conditions, 9496 events. 6880/9496 cut-off events. For 5705/6087 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 49168 event pairs, 1483 based on Foata normal form. 55/9109 useless extension candidates. Maximal degree in co-relation 25295. Up to 7243 conditions per place. [2022-12-06 06:29:42,286 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 65 selfloop transitions, 12 changer transitions 0/80 dead transitions. [2022-12-06 06:29:42,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 80 transitions, 488 flow [2022-12-06 06:29:42,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 06:29:42,289 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:29:42,289 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 172 flow. Second operand 4 states and 85 transitions. [2022-12-06 06:29:42,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 80 transitions, 488 flow [2022-12-06 06:29:42,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:29:42,292 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,292 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2022-12-06 06:29:42,293 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2022-12-06 06:29:42,293 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:42,293 INFO L89 Accepts]: Start accepts. Operand has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,294 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:42,294 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:42,294 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,387 INFO L130 PetriNetUnfolder]: 540/971 cut-off events. [2022-12-06 06:29:42,388 INFO L131 PetriNetUnfolder]: For 748/879 co-relation queries the response was YES. [2022-12-06 06:29:42,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 971 events. 540/971 cut-off events. For 748/879 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5480 event pairs, 250 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 2713. Up to 554 conditions per place. [2022-12-06 06:29:42,395 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,395 INFO L188 LiptonReduction]: Number of co-enabled transitions 594 [2022-12-06 06:29:42,404 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:42,405 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 112 [2022-12-06 06:29:42,405 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 290 flow [2022-12-06 06:29:42,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:42,406 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:42,406 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:42,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:29:42,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:42,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1733583217, now seen corresponding path program 1 times [2022-12-06 06:29:42,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:42,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394604932] [2022-12-06 06:29:42,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:42,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:42,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:42,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394604932] [2022-12-06 06:29:42,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394604932] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:42,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:42,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:42,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480333762] [2022-12-06 06:29:42,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:42,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:42,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:42,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:42,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:42,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:42,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:42,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:42,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:43,729 INFO L130 PetriNetUnfolder]: 7254/10032 cut-off events. [2022-12-06 06:29:43,729 INFO L131 PetriNetUnfolder]: For 12049/12623 co-relation queries the response was YES. [2022-12-06 06:29:43,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31189 conditions, 10032 events. 7254/10032 cut-off events. For 12049/12623 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 51848 event pairs, 2133 based on Foata normal form. 176/9782 useless extension candidates. Maximal degree in co-relation 31173. Up to 7464 conditions per place. [2022-12-06 06:29:43,792 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 70 selfloop transitions, 14 changer transitions 0/87 dead transitions. [2022-12-06 06:29:43,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 87 transitions, 621 flow [2022-12-06 06:29:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:43,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:43,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-06 06:29:43,793 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 06:29:43,793 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 290 flow. Second operand 4 states and 85 transitions. [2022-12-06 06:29:43,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 87 transitions, 621 flow [2022-12-06 06:29:43,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:43,799 INFO L231 Difference]: Finished difference. Result has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,800 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=412, PETRI_PLACES=49, PETRI_TRANSITIONS=57} [2022-12-06 06:29:43,800 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2022-12-06 06:29:43,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:43,800 INFO L89 Accepts]: Start accepts. Operand has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,801 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:43,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:43,801 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,922 INFO L130 PetriNetUnfolder]: 659/1126 cut-off events. [2022-12-06 06:29:43,922 INFO L131 PetriNetUnfolder]: For 1526/1742 co-relation queries the response was YES. [2022-12-06 06:29:43,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 1126 events. 659/1126 cut-off events. For 1526/1742 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6267 event pairs, 270 based on Foata normal form. 5/1066 useless extension candidates. Maximal degree in co-relation 3689. Up to 627 conditions per place. [2022-12-06 06:29:43,933 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,933 INFO L188 LiptonReduction]: Number of co-enabled transitions 676 [2022-12-06 06:29:43,939 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:43,940 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 140 [2022-12-06 06:29:43,940 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 57 transitions, 412 flow [2022-12-06 06:29:43,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:43,940 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:43,940 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:43,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:29:43,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:43,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1733648317, now seen corresponding path program 2 times [2022-12-06 06:29:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:43,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445750242] [2022-12-06 06:29:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:43,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:44,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:44,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:44,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445750242] [2022-12-06 06:29:44,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445750242] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:44,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:44,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241158244] [2022-12-06 06:29:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:44,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:44,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:44,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:44,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 57 transitions, 412 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:44,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:44,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:44,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:45,437 INFO L130 PetriNetUnfolder]: 6857/9493 cut-off events. [2022-12-06 06:29:45,438 INFO L131 PetriNetUnfolder]: For 19008/19689 co-relation queries the response was YES. [2022-12-06 06:29:45,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32612 conditions, 9493 events. 6857/9493 cut-off events. For 19008/19689 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 48814 event pairs, 1986 based on Foata normal form. 288/9364 useless extension candidates. Maximal degree in co-relation 32593. Up to 7328 conditions per place. [2022-12-06 06:29:45,546 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 69 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2022-12-06 06:29:45,546 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 679 flow [2022-12-06 06:29:45,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2022-12-06 06:29:45,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:29:45,549 INFO L175 Difference]: Start difference. First operand has 49 places, 57 transitions, 412 flow. Second operand 4 states and 84 transitions. [2022-12-06 06:29:45,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 679 flow [2022-12-06 06:29:45,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 86 transitions, 664 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:45,563 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,563 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=439, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2022-12-06 06:29:45,565 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-06 06:29:45,565 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:45,566 INFO L89 Accepts]: Start accepts. Operand has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,566 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:45,567 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:45,567 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,687 INFO L130 PetriNetUnfolder]: 622/1052 cut-off events. [2022-12-06 06:29:45,687 INFO L131 PetriNetUnfolder]: For 1900/2111 co-relation queries the response was YES. [2022-12-06 06:29:45,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3629 conditions, 1052 events. 622/1052 cut-off events. For 1900/2111 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5698 event pairs, 287 based on Foata normal form. 5/995 useless extension candidates. Maximal degree in co-relation 3611. Up to 582 conditions per place. [2022-12-06 06:29:45,698 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,698 INFO L188 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-06 06:29:45,714 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:45,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 151 [2022-12-06 06:29:45,717 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 439 flow [2022-12-06 06:29:45,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:45,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:45,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:45,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:29:45,717 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1733651851, now seen corresponding path program 1 times [2022-12-06 06:29:45,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:45,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143935057] [2022-12-06 06:29:45,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:45,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:46,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:46,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143935057] [2022-12-06 06:29:46,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143935057] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:46,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:46,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:46,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976663582] [2022-12-06 06:29:46,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:46,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:46,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:46,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:46,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:46,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:46,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 439 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:46,083 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:46,083 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:46,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:46,992 INFO L130 PetriNetUnfolder]: 7298/10088 cut-off events. [2022-12-06 06:29:46,992 INFO L131 PetriNetUnfolder]: For 24290/24941 co-relation queries the response was YES. [2022-12-06 06:29:47,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35701 conditions, 10088 events. 7298/10088 cut-off events. For 24290/24941 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 51827 event pairs, 1921 based on Foata normal form. 417/10106 useless extension candidates. Maximal degree in co-relation 35680. Up to 7421 conditions per place. [2022-12-06 06:29:47,057 INFO L137 encePairwiseOnDemand]: 21/35 looper letters, 80 selfloop transitions, 29 changer transitions 0/112 dead transitions. [2022-12-06 06:29:47,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 913 flow [2022-12-06 06:29:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:47,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:47,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-12-06 06:29:47,059 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2022-12-06 06:29:47,059 INFO L175 Difference]: Start difference. First operand has 52 places, 57 transitions, 439 flow. Second operand 5 states and 109 transitions. [2022-12-06 06:29:47,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 913 flow [2022-12-06 06:29:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 112 transitions, 883 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:29:47,068 INFO L231 Difference]: Finished difference. Result has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,069 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=612, PETRI_PLACES=54, PETRI_TRANSITIONS=70} [2022-12-06 06:29:47,069 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2022-12-06 06:29:47,069 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:47,069 INFO L89 Accepts]: Start accepts. Operand has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,070 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:47,070 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:47,070 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,193 INFO L130 PetriNetUnfolder]: 782/1274 cut-off events. [2022-12-06 06:29:47,193 INFO L131 PetriNetUnfolder]: For 3008/3279 co-relation queries the response was YES. [2022-12-06 06:29:47,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 1274 events. 782/1274 cut-off events. For 3008/3279 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6845 event pairs, 319 based on Foata normal form. 45/1257 useless extension candidates. Maximal degree in co-relation 5117. Up to 717 conditions per place. [2022-12-06 06:29:47,205 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 774 [2022-12-06 06:29:47,218 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:47,218 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 149 [2022-12-06 06:29:47,218 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 70 transitions, 612 flow [2022-12-06 06:29:47,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:47,219 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:47,219 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:47,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:29:47,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:47,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1733573731, now seen corresponding path program 2 times [2022-12-06 06:29:47,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814526430] [2022-12-06 06:29:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:47,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:47,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814526430] [2022-12-06 06:29:47,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814526430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:47,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:47,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:47,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039353942] [2022-12-06 06:29:47,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:47,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:47,563 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:47,564 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 70 transitions, 612 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:47,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:47,565 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:47,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:48,880 INFO L130 PetriNetUnfolder]: 9035/12670 cut-off events. [2022-12-06 06:29:48,880 INFO L131 PetriNetUnfolder]: For 43660/45107 co-relation queries the response was YES. [2022-12-06 06:29:48,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48996 conditions, 12670 events. 9035/12670 cut-off events. For 43660/45107 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 70441 event pairs, 2385 based on Foata normal form. 1038/13181 useless extension candidates. Maximal degree in co-relation 48974. Up to 7495 conditions per place. [2022-12-06 06:29:48,959 INFO L137 encePairwiseOnDemand]: 23/35 looper letters, 72 selfloop transitions, 28 changer transitions 0/103 dead transitions. [2022-12-06 06:29:48,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 103 transitions, 950 flow [2022-12-06 06:29:48,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 06:29:48,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2022-12-06 06:29:48,960 INFO L175 Difference]: Start difference. First operand has 54 places, 70 transitions, 612 flow. Second operand 5 states and 88 transitions. [2022-12-06 06:29:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 103 transitions, 950 flow [2022-12-06 06:29:48,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 103 transitions, 885 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-12-06 06:29:48,977 INFO L231 Difference]: Finished difference. Result has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:48,978 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=705, PETRI_PLACES=57, PETRI_TRANSITIONS=75} [2022-12-06 06:29:48,978 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-06 06:29:48,978 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:48,978 INFO L89 Accepts]: Start accepts. Operand has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:48,979 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:48,979 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:48,979 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:49,109 INFO L130 PetriNetUnfolder]: 924/1514 cut-off events. [2022-12-06 06:29:49,109 INFO L131 PetriNetUnfolder]: For 5441/5787 co-relation queries the response was YES. [2022-12-06 06:29:49,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6673 conditions, 1514 events. 924/1514 cut-off events. For 5441/5787 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8491 event pairs, 343 based on Foata normal form. 61/1499 useless extension candidates. Maximal degree in co-relation 6652. Up to 844 conditions per place. [2022-12-06 06:29:49,124 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:49,124 INFO L188 LiptonReduction]: Number of co-enabled transitions 866 [2022-12-06 06:29:49,159 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:49,160 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 06:29:49,160 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 75 transitions, 705 flow [2022-12-06 06:29:49,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:49,160 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:49,160 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:49,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:29:49,160 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:49,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2093570882, now seen corresponding path program 1 times [2022-12-06 06:29:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:49,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307858439] [2022-12-06 06:29:49,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:49,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307858439] [2022-12-06 06:29:49,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307858439] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:49,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:49,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725220211] [2022-12-06 06:29:49,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:49,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:49,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:49,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 06:29:49,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 75 transitions, 705 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:49,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:49,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 06:29:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:50,792 INFO L130 PetriNetUnfolder]: 10135/14404 cut-off events. [2022-12-06 06:29:50,792 INFO L131 PetriNetUnfolder]: For 64004/66047 co-relation queries the response was YES. [2022-12-06 06:29:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59012 conditions, 14404 events. 10135/14404 cut-off events. For 64004/66047 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 83927 event pairs, 2516 based on Foata normal form. 1190/14995 useless extension candidates. Maximal degree in co-relation 58988. Up to 6909 conditions per place. [2022-12-06 06:29:50,912 INFO L137 encePairwiseOnDemand]: 25/35 looper letters, 76 selfloop transitions, 27 changer transitions 0/106 dead transitions. [2022-12-06 06:29:50,912 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 1047 flow [2022-12-06 06:29:50,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 06:29:50,914 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2022-12-06 06:29:50,914 INFO L175 Difference]: Start difference. First operand has 57 places, 75 transitions, 705 flow. Second operand 5 states and 88 transitions. [2022-12-06 06:29:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 1047 flow [2022-12-06 06:29:50,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 1023 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:50,973 INFO L231 Difference]: Finished difference. Result has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:50,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=801, PETRI_PLACES=60, PETRI_TRANSITIONS=78} [2022-12-06 06:29:50,973 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-06 06:29:50,973 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:50,974 INFO L89 Accepts]: Start accepts. Operand has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:50,974 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:50,974 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:50,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:50,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:51,110 INFO L130 PetriNetUnfolder]: 949/1635 cut-off events. [2022-12-06 06:29:51,110 INFO L131 PetriNetUnfolder]: For 6490/6888 co-relation queries the response was YES. [2022-12-06 06:29:51,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 1635 events. 949/1635 cut-off events. For 6490/6888 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9930 event pairs, 396 based on Foata normal form. 78/1638 useless extension candidates. Maximal degree in co-relation 7593. Up to 888 conditions per place. [2022-12-06 06:29:51,126 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:51,127 INFO L188 LiptonReduction]: Number of co-enabled transitions 918 [2022-12-06 06:29:51,152 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:51,152 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 179 [2022-12-06 06:29:51,152 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 78 transitions, 801 flow [2022-12-06 06:29:51,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:51,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:51,153 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:51,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:29:51,153 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:51,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -649235226, now seen corresponding path program 1 times [2022-12-06 06:29:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:51,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640284219] [2022-12-06 06:29:51,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:51,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:51,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640284219] [2022-12-06 06:29:51,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640284219] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:51,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:51,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:29:51,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646383657] [2022-12-06 06:29:51,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:51,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:29:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:51,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:29:51,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:29:51,246 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 35 [2022-12-06 06:29:51,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 78 transitions, 801 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:51,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:51,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 35 [2022-12-06 06:29:51,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:52,262 INFO L130 PetriNetUnfolder]: 6357/9349 cut-off events. [2022-12-06 06:29:52,262 INFO L131 PetriNetUnfolder]: For 49154/49622 co-relation queries the response was YES. [2022-12-06 06:29:52,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40819 conditions, 9349 events. 6357/9349 cut-off events. For 49154/49622 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 54240 event pairs, 1717 based on Foata normal form. 480/9416 useless extension candidates. Maximal degree in co-relation 40794. Up to 7388 conditions per place. [2022-12-06 06:29:52,339 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 95 selfloop transitions, 5 changer transitions 0/106 dead transitions. [2022-12-06 06:29:52,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 1191 flow [2022-12-06 06:29:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:29:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:29:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 06:29:52,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2022-12-06 06:29:52,341 INFO L175 Difference]: Start difference. First operand has 60 places, 78 transitions, 801 flow. Second operand 3 states and 61 transitions. [2022-12-06 06:29:52,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 1191 flow [2022-12-06 06:29:52,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 1149 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 06:29:52,362 INFO L231 Difference]: Finished difference. Result has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,363 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=677, PETRI_PLACES=60, PETRI_TRANSITIONS=73} [2022-12-06 06:29:52,363 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-06 06:29:52,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:52,363 INFO L89 Accepts]: Start accepts. Operand has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,364 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:52,364 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:52,364 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,578 INFO L130 PetriNetUnfolder]: 1531/2722 cut-off events. [2022-12-06 06:29:52,578 INFO L131 PetriNetUnfolder]: For 7658/8228 co-relation queries the response was YES. [2022-12-06 06:29:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10565 conditions, 2722 events. 1531/2722 cut-off events. For 7658/8228 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 19227 event pairs, 711 based on Foata normal form. 70/2507 useless extension candidates. Maximal degree in co-relation 10542. Up to 1166 conditions per place. [2022-12-06 06:29:52,608 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,608 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 06:29:52,618 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:29:52,619 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 256 [2022-12-06 06:29:52,619 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 73 transitions, 677 flow [2022-12-06 06:29:52,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:52,619 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:52,619 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:29:52,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:29:52,619 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:52,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:52,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1937846464, now seen corresponding path program 1 times [2022-12-06 06:29:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:52,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258097563] [2022-12-06 06:29:52,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:52,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:52,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258097563] [2022-12-06 06:29:52,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258097563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:52,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:52,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:29:52,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085541633] [2022-12-06 06:29:52,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:52,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:29:52,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:52,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:29:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:29:52,803 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 06:29:52,803 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 73 transitions, 677 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-06 06:29:52,803 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:52,803 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 06:29:52,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:53,294 INFO L130 PetriNetUnfolder]: 3389/5244 cut-off events. [2022-12-06 06:29:53,296 INFO L131 PetriNetUnfolder]: For 26667/26928 co-relation queries the response was YES. [2022-12-06 06:29:53,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24148 conditions, 5244 events. 3389/5244 cut-off events. For 26667/26928 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 29818 event pairs, 746 based on Foata normal form. 476/5520 useless extension candidates. Maximal degree in co-relation 24122. Up to 2180 conditions per place. [2022-12-06 06:29:53,331 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 119 selfloop transitions, 9 changer transitions 0/134 dead transitions. [2022-12-06 06:29:53,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 134 transitions, 1458 flow [2022-12-06 06:29:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:29:53,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:29:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-12-06 06:29:53,333 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5955882352941176 [2022-12-06 06:29:53,333 INFO L175 Difference]: Start difference. First operand has 60 places, 73 transitions, 677 flow. Second operand 4 states and 81 transitions. [2022-12-06 06:29:53,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 134 transitions, 1458 flow [2022-12-06 06:29:53,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 134 transitions, 1453 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:29:53,353 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 704 flow [2022-12-06 06:29:53,353 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2022-12-06 06:29:53,354 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2022-12-06 06:29:53,354 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:53,355 INFO L89 Accepts]: Start accepts. Operand has 63 places, 75 transitions, 704 flow [2022-12-06 06:29:53,357 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:53,357 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:53,358 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 75 transitions, 704 flow [2022-12-06 06:29:53,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 75 transitions, 704 flow [2022-12-06 06:29:53,468 INFO L130 PetriNetUnfolder]: 721/1434 cut-off events. [2022-12-06 06:29:53,468 INFO L131 PetriNetUnfolder]: For 4290/4766 co-relation queries the response was YES. [2022-12-06 06:29:53,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 1434 events. 721/1434 cut-off events. For 4290/4766 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 9476 event pairs, 252 based on Foata normal form. 74/1402 useless extension candidates. Maximal degree in co-relation 6074. Up to 572 conditions per place. [2022-12-06 06:29:53,481 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 75 transitions, 704 flow [2022-12-06 06:29:53,482 INFO L188 LiptonReduction]: Number of co-enabled transitions 1070 [2022-12-06 06:29:54,890 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:29:54,891 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1537 [2022-12-06 06:29:54,891 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 76 transitions, 730 flow [2022-12-06 06:29:54,891 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-06 06:29:54,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:54,892 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-06 06:29:54,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:29:54,892 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1999982048, now seen corresponding path program 1 times [2022-12-06 06:29:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:54,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636094223] [2022-12-06 06:29:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:55,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636094223] [2022-12-06 06:29:55,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636094223] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:55,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:55,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:29:55,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246532786] [2022-12-06 06:29:55,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:55,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:29:55,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:55,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:29:55,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:29:55,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2022-12-06 06:29:55,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 76 transitions, 730 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:55,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:55,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2022-12-06 06:29:55,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:55,495 INFO L130 PetriNetUnfolder]: 2550/3944 cut-off events. [2022-12-06 06:29:55,495 INFO L131 PetriNetUnfolder]: For 22511/22734 co-relation queries the response was YES. [2022-12-06 06:29:55,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19148 conditions, 3944 events. 2550/3944 cut-off events. For 22511/22734 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 21898 event pairs, 550 based on Foata normal form. 258/4051 useless extension candidates. Maximal degree in co-relation 19120. Up to 1526 conditions per place. [2022-12-06 06:29:55,552 INFO L137 encePairwiseOnDemand]: 29/36 looper letters, 133 selfloop transitions, 13 changer transitions 0/152 dead transitions. [2022-12-06 06:29:55,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 152 transitions, 1669 flow [2022-12-06 06:29:55,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:29:55,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:29:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2022-12-06 06:29:55,553 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:29:55,553 INFO L175 Difference]: Start difference. First operand has 64 places, 76 transitions, 730 flow. Second operand 5 states and 100 transitions. [2022-12-06 06:29:55,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 152 transitions, 1669 flow [2022-12-06 06:29:55,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 152 transitions, 1651 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:29:55,599 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 748 flow [2022-12-06 06:29:55,600 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=748, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2022-12-06 06:29:55,600 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2022-12-06 06:29:55,600 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:55,600 INFO L89 Accepts]: Start accepts. Operand has 66 places, 78 transitions, 748 flow [2022-12-06 06:29:55,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:55,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:55,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 78 transitions, 748 flow [2022-12-06 06:29:55,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 78 transitions, 748 flow [2022-12-06 06:29:55,726 INFO L130 PetriNetUnfolder]: 406/852 cut-off events. [2022-12-06 06:29:55,726 INFO L131 PetriNetUnfolder]: For 2831/3166 co-relation queries the response was YES. [2022-12-06 06:29:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 852 events. 406/852 cut-off events. For 2831/3166 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5096 event pairs, 93 based on Foata normal form. 67/863 useless extension candidates. Maximal degree in co-relation 3718. Up to 276 conditions per place. [2022-12-06 06:29:55,736 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 78 transitions, 748 flow [2022-12-06 06:29:55,736 INFO L188 LiptonReduction]: Number of co-enabled transitions 1038 [2022-12-06 06:29:56,163 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:29:56,164 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 564 [2022-12-06 06:29:56,164 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 77 transitions, 739 flow [2022-12-06 06:29:56,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:56,165 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:29:56,165 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-06 06:29:56,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:29:56,165 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:29:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:29:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -54970474, now seen corresponding path program 1 times [2022-12-06 06:29:56,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:29:56,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388330265] [2022-12-06 06:29:56,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:29:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:29:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:29:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:29:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:29:56,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388330265] [2022-12-06 06:29:56,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388330265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:29:56,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:29:56,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:29:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149656532] [2022-12-06 06:29:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:29:56,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:29:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:29:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:29:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:29:56,331 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 06:29:56,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 77 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:29:56,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:29:56,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 06:29:56,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:29:56,718 INFO L130 PetriNetUnfolder]: 2477/3793 cut-off events. [2022-12-06 06:29:56,719 INFO L131 PetriNetUnfolder]: For 22406/22624 co-relation queries the response was YES. [2022-12-06 06:29:56,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18673 conditions, 3793 events. 2477/3793 cut-off events. For 22406/22624 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 20993 event pairs, 535 based on Foata normal form. 115/3760 useless extension candidates. Maximal degree in co-relation 18644. Up to 1526 conditions per place. [2022-12-06 06:29:56,744 INFO L137 encePairwiseOnDemand]: 28/34 looper letters, 126 selfloop transitions, 17 changer transitions 2/151 dead transitions. [2022-12-06 06:29:56,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 151 transitions, 1684 flow [2022-12-06 06:29:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:29:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:29:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2022-12-06 06:29:56,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5049019607843137 [2022-12-06 06:29:56,745 INFO L175 Difference]: Start difference. First operand has 66 places, 77 transitions, 739 flow. Second operand 6 states and 103 transitions. [2022-12-06 06:29:56,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 151 transitions, 1684 flow [2022-12-06 06:29:56,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 151 transitions, 1598 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-12-06 06:29:56,806 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 714 flow [2022-12-06 06:29:56,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2022-12-06 06:29:56,807 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2022-12-06 06:29:56,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:29:56,807 INFO L89 Accepts]: Start accepts. Operand has 68 places, 77 transitions, 714 flow [2022-12-06 06:29:56,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:29:56,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:29:56,808 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 77 transitions, 714 flow [2022-12-06 06:29:56,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 77 transitions, 714 flow [2022-12-06 06:29:56,860 INFO L130 PetriNetUnfolder]: 370/757 cut-off events. [2022-12-06 06:29:56,860 INFO L131 PetriNetUnfolder]: For 2468/2663 co-relation queries the response was YES. [2022-12-06 06:29:56,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 757 events. 370/757 cut-off events. For 2468/2663 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4525 event pairs, 75 based on Foata normal form. 9/715 useless extension candidates. Maximal degree in co-relation 3268. Up to 222 conditions per place. [2022-12-06 06:29:56,866 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 77 transitions, 714 flow [2022-12-06 06:29:56,866 INFO L188 LiptonReduction]: Number of co-enabled transitions 970 [2022-12-06 06:29:57,478 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L804-->L811: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_90 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_77 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_90) v_~x$w_buff0_used~0_89) (= (ite .cse0 v_~x$w_buff0~0_38 (ite .cse1 v_~x$w_buff1~0_33 v_~x~0_56)) v_~x~0_55) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_20) v_~x$r_buff0_thd3~0_19) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_77) v_~x$w_buff1_used~0_76) (= v_~x$r_buff1_thd3~0_15 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_76 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_90} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 06:29:57,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_107 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18) v_~x$r_buff1_thd2~0_17) (= v_~x$r_buff0_thd2~0_32 (ite .cse2 0 v_~x$r_buff0_thd2~0_33)) (= (ite .cse0 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_41 v_~x~0_76)) v_~x~0_75)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 06:29:57,581 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L824-->L831: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_26 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_125 256) 0)))) (.cse4 (and .cse5 .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0))))) (and (= v_~x$r_buff1_thd4~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_26)) (= (ite .cse2 v_~x$w_buff0~0_58 (ite .cse3 v_~x$w_buff1~0_51 v_~x~0_90)) v_~x~0_89) (= (ite .cse4 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124) (= (ite .cse2 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [375] L751-->L754: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] [2022-12-06 06:30:04,079 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:30:04,080 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7273 [2022-12-06 06:30:04,080 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 72 transitions, 671 flow [2022-12-06 06:30:04,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:04,080 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:04,080 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-06 06:30:04,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:30:04,080 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1955476724, now seen corresponding path program 1 times [2022-12-06 06:30:04,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:04,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758057446] [2022-12-06 06:30:04,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:04,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:04,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758057446] [2022-12-06 06:30:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758057446] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:04,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:04,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:04,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313496520] [2022-12-06 06:30:04,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:04,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:04,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:04,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:04,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:04,317 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2022-12-06 06:30:04,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 72 transitions, 671 flow. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:04,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:04,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2022-12-06 06:30:04,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:04,817 INFO L130 PetriNetUnfolder]: 3119/4913 cut-off events. [2022-12-06 06:30:04,817 INFO L131 PetriNetUnfolder]: For 25663/25964 co-relation queries the response was YES. [2022-12-06 06:30:04,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23902 conditions, 4913 events. 3119/4913 cut-off events. For 25663/25964 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 29330 event pairs, 634 based on Foata normal form. 148/4888 useless extension candidates. Maximal degree in co-relation 23873. Up to 2704 conditions per place. [2022-12-06 06:30:04,845 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 88 selfloop transitions, 1 changer transitions 56/150 dead transitions. [2022-12-06 06:30:04,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 150 transitions, 1669 flow [2022-12-06 06:30:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:04,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2022-12-06 06:30:04,846 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2022-12-06 06:30:04,846 INFO L175 Difference]: Start difference. First operand has 66 places, 72 transitions, 671 flow. Second operand 4 states and 72 transitions. [2022-12-06 06:30:04,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 150 transitions, 1669 flow [2022-12-06 06:30:04,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 150 transitions, 1512 flow, removed 46 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:04,917 INFO L231 Difference]: Finished difference. Result has 67 places, 67 transitions, 536 flow [2022-12-06 06:30:04,917 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=536, PETRI_PLACES=67, PETRI_TRANSITIONS=67} [2022-12-06 06:30:04,918 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2022-12-06 06:30:04,918 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:04,918 INFO L89 Accepts]: Start accepts. Operand has 67 places, 67 transitions, 536 flow [2022-12-06 06:30:04,919 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:04,919 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:04,919 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 67 transitions, 536 flow [2022-12-06 06:30:04,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 536 flow [2022-12-06 06:30:04,963 INFO L130 PetriNetUnfolder]: 280/619 cut-off events. [2022-12-06 06:30:04,964 INFO L131 PetriNetUnfolder]: For 1758/1885 co-relation queries the response was YES. [2022-12-06 06:30:04,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 619 events. 280/619 cut-off events. For 1758/1885 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3670 event pairs, 39 based on Foata normal form. 38/617 useless extension candidates. Maximal degree in co-relation 2290. Up to 159 conditions per place. [2022-12-06 06:30:04,970 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 536 flow [2022-12-06 06:30:04,970 INFO L188 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-06 06:30:05,396 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [397] L821-->L824: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~a~0_2) InVars {~a~0=v_~a~0_2} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~a~0=v_~a~0_2} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0] and [541] $Ultimate##0-->L831: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_525 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_104 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_108 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_480 256) 0)) .cse3)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_526 256) 0)) .cse5)) (.cse2 (and .cse5 .cse4))) (and (= |v_P0Thread1of1ForFork3_#in~arg.offset_33| v_P0Thread1of1ForFork3_~arg.offset_33) (= v_~x~0_451 (ite .cse0 v_~x$w_buff0~0_340 (ite .cse1 v_~x$w_buff1~0_298 1))) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_480) v_~x$w_buff1_used~0_479) (= v_~x$w_buff0_used~0_525 (ite .cse0 0 v_~x$w_buff0_used~0_526)) (= v_~x$r_buff0_thd4~0_103 (ite .cse2 0 v_~x$r_buff0_thd4~0_104)) (= v_P0Thread1of1ForFork3_~arg.base_33 |v_P0Thread1of1ForFork3_#in~arg.base_33|) (= v_~a~0_55 1) (= (ite (or (and (not (= (mod v_~x$w_buff1_used~0_479 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd4~0_103 256) 0)) .cse4)) 0 v_~x$r_buff1_thd4~0_108) v_~x$r_buff1_thd4~0_107)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$w_buff1~0=v_~x$w_buff1~0_298, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_33|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_480, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_104, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_108, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_526} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, ~a~0=v_~a~0_55, ~x$w_buff1~0=v_~x$w_buff1~0_298, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_33|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_33, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_479, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_103, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_33, ~x~0=v_~x~0_451, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_33|, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_107, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_525} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, ~x$w_buff1_used~0, ~x$r_buff0_thd4~0, P0Thread1of1ForFork3_~arg.offset, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:30:05,480 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L824-->L831: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_26 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_125 256) 0)))) (.cse4 (and .cse5 .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0))))) (and (= v_~x$r_buff1_thd4~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_26)) (= (ite .cse2 v_~x$w_buff0~0_58 (ite .cse3 v_~x$w_buff1~0_51 v_~x~0_90)) v_~x~0_89) (= (ite .cse4 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124) (= (ite .cse2 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [535] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_21 |v_P0Thread1of1ForFork3_#in~arg.base_21|) (= v_~a~0_43 1) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_21| v_P0Thread1of1ForFork3_~arg.offset_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} OutVars{~a~0=v_~a~0_43, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_21, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_21, ~x~0=v_~x~0_439, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] [2022-12-06 06:30:05,559 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:30:05,560 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 642 [2022-12-06 06:30:05,560 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 566 flow [2022-12-06 06:30:05,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:05,560 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:05,560 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-06 06:30:05,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:30:05,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1317106888, now seen corresponding path program 1 times [2022-12-06 06:30:05,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:05,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097277164] [2022-12-06 06:30:05,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:05,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:05,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097277164] [2022-12-06 06:30:05,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097277164] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:05,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:05,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851868727] [2022-12-06 06:30:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:05,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:05,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 34 [2022-12-06 06:30:05,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 566 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:05,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:05,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 34 [2022-12-06 06:30:05,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:06,231 INFO L130 PetriNetUnfolder]: 3036/4837 cut-off events. [2022-12-06 06:30:06,231 INFO L131 PetriNetUnfolder]: For 19609/19661 co-relation queries the response was YES. [2022-12-06 06:30:06,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21182 conditions, 4837 events. 3036/4837 cut-off events. For 19609/19661 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28202 event pairs, 471 based on Foata normal form. 17/4817 useless extension candidates. Maximal degree in co-relation 21154. Up to 2204 conditions per place. [2022-12-06 06:30:06,253 INFO L137 encePairwiseOnDemand]: 30/34 looper letters, 83 selfloop transitions, 1 changer transitions 56/142 dead transitions. [2022-12-06 06:30:06,254 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 142 transitions, 1508 flow [2022-12-06 06:30:06,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-06 06:30:06,255 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-06 06:30:06,255 INFO L175 Difference]: Start difference. First operand has 65 places, 66 transitions, 566 flow. Second operand 4 states and 76 transitions. [2022-12-06 06:30:06,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 142 transitions, 1508 flow [2022-12-06 06:30:06,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 142 transitions, 1464 flow, removed 10 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:06,300 INFO L231 Difference]: Finished difference. Result has 68 places, 60 transitions, 489 flow [2022-12-06 06:30:06,301 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=489, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-12-06 06:30:06,301 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2022-12-06 06:30:06,301 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:06,301 INFO L89 Accepts]: Start accepts. Operand has 68 places, 60 transitions, 489 flow [2022-12-06 06:30:06,302 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:06,302 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:06,302 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 60 transitions, 489 flow [2022-12-06 06:30:06,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 67 places, 60 transitions, 489 flow [2022-12-06 06:30:06,339 INFO L130 PetriNetUnfolder]: 221/535 cut-off events. [2022-12-06 06:30:06,339 INFO L131 PetriNetUnfolder]: For 1645/1809 co-relation queries the response was YES. [2022-12-06 06:30:06,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2024 conditions, 535 events. 221/535 cut-off events. For 1645/1809 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3296 event pairs, 23 based on Foata normal form. 47/550 useless extension candidates. Maximal degree in co-relation 1997. Up to 144 conditions per place. [2022-12-06 06:30:06,343 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 60 transitions, 489 flow [2022-12-06 06:30:06,344 INFO L188 LiptonReduction]: Number of co-enabled transitions 680 [2022-12-06 06:30:06,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [503] $Ultimate##0-->L801: Formula: (and (= v_P2Thread1of1ForFork2_~arg.base_5 |v_P2Thread1of1ForFork2_#in~arg.base_5|) (= |v_P2Thread1of1ForFork2_#in~arg.offset_5| v_P2Thread1of1ForFork2_~arg.offset_5) (= v_~y~0_19 1)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_5|, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_5, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_5, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_5|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~y~0] and [539] $Ultimate##0-->L804: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_29 |v_P0Thread1of1ForFork3_#in~arg.base_29|) (= v_~a~0_51 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_29| v_P0Thread1of1ForFork3_~arg.offset_29) (= v_~z~0_43 v_~__unbuffered_p2_EAX~0_93) (= v_~x~0_447 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_29|, ~z~0=v_~z~0_43, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_29|} OutVars{~a~0=v_~a~0_51, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_29|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_93, ~z~0=v_~z~0_43, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_29, ~x~0=v_~x~0_447, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_29|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, ~__unbuffered_p2_EAX~0, P0Thread1of1ForFork3_~arg.offset, ~x~0] [2022-12-06 06:30:06,398 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:06,399 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 98 [2022-12-06 06:30:06,399 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 490 flow [2022-12-06 06:30:06,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:06,399 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:06,399 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-06 06:30:06,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:30:06,399 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:06,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1828415257, now seen corresponding path program 1 times [2022-12-06 06:30:06,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:06,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506952209] [2022-12-06 06:30:06,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:06,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:06,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:06,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:06,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506952209] [2022-12-06 06:30:06,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506952209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:06,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:06,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:06,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63491502] [2022-12-06 06:30:06,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:06,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:06,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:06,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:06,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:06,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 06:30:06,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:06,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:06,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 06:30:06,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:06,901 INFO L130 PetriNetUnfolder]: 1960/3219 cut-off events. [2022-12-06 06:30:06,901 INFO L131 PetriNetUnfolder]: For 14160/14211 co-relation queries the response was YES. [2022-12-06 06:30:06,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15328 conditions, 3219 events. 1960/3219 cut-off events. For 14160/14211 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 18213 event pairs, 598 based on Foata normal form. 1/3183 useless extension candidates. Maximal degree in co-relation 15299. Up to 1189 conditions per place. [2022-12-06 06:30:06,916 INFO L137 encePairwiseOnDemand]: 27/31 looper letters, 51 selfloop transitions, 1 changer transitions 77/131 dead transitions. [2022-12-06 06:30:06,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 1408 flow [2022-12-06 06:30:06,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-12-06 06:30:06,918 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2022-12-06 06:30:06,918 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 490 flow. Second operand 4 states and 67 transitions. [2022-12-06 06:30:06,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 1408 flow [2022-12-06 06:30:06,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 131 transitions, 1402 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:06,951 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 345 flow [2022-12-06 06:30:06,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2022-12-06 06:30:06,952 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2022-12-06 06:30:06,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:06,952 INFO L89 Accepts]: Start accepts. Operand has 69 places, 46 transitions, 345 flow [2022-12-06 06:30:06,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:06,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:06,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 46 transitions, 345 flow [2022-12-06 06:30:06,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 46 transitions, 345 flow [2022-12-06 06:30:06,981 INFO L130 PetriNetUnfolder]: 162/408 cut-off events. [2022-12-06 06:30:06,981 INFO L131 PetriNetUnfolder]: For 911/1017 co-relation queries the response was YES. [2022-12-06 06:30:06,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 408 events. 162/408 cut-off events. For 911/1017 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2387 event pairs, 9 based on Foata normal form. 34/418 useless extension candidates. Maximal degree in co-relation 1483. Up to 132 conditions per place. [2022-12-06 06:30:06,984 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 46 transitions, 345 flow [2022-12-06 06:30:06,984 INFO L188 LiptonReduction]: Number of co-enabled transitions 418 [2022-12-06 06:30:06,987 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [398] L824-->L831: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse1 (not (= (mod v_~x$w_buff0_used~0_135 256) 0))) (.cse0 (not (= (mod v_~x$r_buff1_thd4~0_26 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~x$w_buff1_used~0_125 256) 0)))) (.cse4 (and .cse5 .cse1)) (.cse2 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_136 256) 0))))) (and (= v_~x$r_buff1_thd4~0_25 (ite (or (and .cse0 (not (= (mod v_~x$w_buff1_used~0_124 256) 0))) (and .cse1 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0)))) 0 v_~x$r_buff1_thd4~0_26)) (= (ite .cse2 v_~x$w_buff0~0_58 (ite .cse3 v_~x$w_buff1~0_51 v_~x~0_90)) v_~x~0_89) (= (ite .cse4 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_125) v_~x$w_buff1_used~0_124) (= (ite .cse2 0 v_~x$w_buff0_used~0_136) v_~x$w_buff0_used~0_135)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_125, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_90, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_26, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_136} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_89, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_25, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_135} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] and [535] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_21 |v_P0Thread1of1ForFork3_#in~arg.base_21|) (= v_~a~0_43 1) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_21| v_P0Thread1of1ForFork3_~arg.offset_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} OutVars{~a~0=v_~a~0_43, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_21, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_21, ~x~0=v_~x~0_439, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] [2022-12-06 06:30:07,068 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [391] L804-->L811: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_89 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_16 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_20 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_90 256) 0)) .cse5)) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_77 256) 0)) .cse3)) (.cse2 (and .cse4 .cse5))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_90) v_~x$w_buff0_used~0_89) (= (ite .cse0 v_~x$w_buff0~0_38 (ite .cse1 v_~x$w_buff1~0_33 v_~x~0_56)) v_~x~0_55) (= (ite .cse2 0 v_~x$r_buff0_thd3~0_20) v_~x$r_buff0_thd3~0_19) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_77) v_~x$w_buff1_used~0_76) (= v_~x$r_buff1_thd3~0_15 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_76 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_19 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_16))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_20, ~x~0=v_~x~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_90} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_38, ~x$w_buff1~0=v_~x$w_buff1~0_33, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_76, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ~x~0=v_~x~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_89} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] and [535] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_21 |v_P0Thread1of1ForFork3_#in~arg.base_21|) (= v_~a~0_43 1) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_21| v_P0Thread1of1ForFork3_~arg.offset_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} OutVars{~a~0=v_~a~0_43, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_21, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_21, ~x~0=v_~x~0_439, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] [2022-12-06 06:30:07,144 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [384] L784-->L791: Formula: (let ((.cse4 (not (= (mod v_~x$r_buff1_thd2~0_18 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0)))) (let ((.cse2 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0)))) (.cse1 (and (not (= (mod v_~x$w_buff1_used~0_107 256) 0)) .cse4))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_107) v_~x$w_buff1_used~0_106) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_106 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_18) v_~x$r_buff1_thd2~0_17) (= v_~x$r_buff0_thd2~0_32 (ite .cse2 0 v_~x$r_buff0_thd2~0_33)) (= (ite .cse0 v_~x$w_buff0~0_46 (ite .cse1 v_~x$w_buff1~0_41 v_~x~0_76)) v_~x~0_75)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_107, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_106, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] and [535] $Ultimate##0-->L754: Formula: (and (= v_P0Thread1of1ForFork3_~arg.base_21 |v_P0Thread1of1ForFork3_#in~arg.base_21|) (= v_~a~0_43 1) (= v_~x~0_439 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_21| v_P0Thread1of1ForFork3_~arg.offset_21)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} OutVars{~a~0=v_~a~0_43, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_21|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_21, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_21, ~x~0=v_~x~0_439, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_21|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] [2022-12-06 06:30:07,245 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:30:07,245 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 293 [2022-12-06 06:30:07,245 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 355 flow [2022-12-06 06:30:07,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:07,245 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:07,246 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-06 06:30:07,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:30:07,246 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:07,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1878737617, now seen corresponding path program 1 times [2022-12-06 06:30:07,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:07,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174421911] [2022-12-06 06:30:07,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:07,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:07,281 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:30:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:30:07,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:30:07,340 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:30:07,341 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:30:07,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:30:07,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:30:07,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:30:07,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:30:07,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:30:07,344 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:30:07,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-06 06:30:07,345 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:07,348 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:30:07,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:30:07,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:30:07 BasicIcfg [2022-12-06 06:30:07,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:30:07,424 INFO L158 Benchmark]: Toolchain (without parser) took 36429.79ms. Allocated memory was 200.3MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 174.8MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-12-06 06:30:07,424 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 176.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:30:07,424 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.16ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 146.9MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:30:07,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.48ms. Allocated memory is still 200.3MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:07,425 INFO L158 Benchmark]: Boogie Preprocessor took 40.93ms. Allocated memory is still 200.3MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:30:07,425 INFO L158 Benchmark]: RCFGBuilder took 705.75ms. Allocated memory is still 200.3MB. Free memory was 142.2MB in the beginning and 103.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. [2022-12-06 06:30:07,425 INFO L158 Benchmark]: TraceAbstraction took 35066.66ms. Allocated memory was 200.3MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 103.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 937.7MB. Max. memory is 8.0GB. [2022-12-06 06:30:07,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 200.3MB. Free memory is still 176.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 524.16ms. Allocated memory is still 200.3MB. Free memory was 174.8MB in the beginning and 146.9MB in the end (delta: 27.9MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.48ms. Allocated memory is still 200.3MB. Free memory was 146.9MB in the beginning and 144.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.93ms. Allocated memory is still 200.3MB. Free memory was 144.3MB in the beginning and 142.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 705.75ms. Allocated memory is still 200.3MB. Free memory was 142.2MB in the beginning and 103.9MB in the end (delta: 38.3MB). Peak memory consumption was 38.8MB. Max. memory is 8.0GB. * TraceAbstraction took 35066.66ms. Allocated memory was 200.3MB in the beginning and 2.4GB in the end (delta: 2.2GB). Free memory was 103.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 937.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 136 PlacesBefore, 46 PlacesAfterwards, 125 TransitionsBefore, 34 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 2075, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2147, independent: 2075, independent conditional: 0, independent unconditional: 2075, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1810, independent: 1757, independent conditional: 0, independent unconditional: 1757, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1810, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 76, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 207, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2147, independent: 318, independent conditional: 0, independent unconditional: 318, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 1810, unknown conditional: 0, unknown unconditional: 1810] , Statistics on independence cache: Total cache size (in pairs): 2829, Positive cache size: 2776, Positive conditional cache size: 0, Positive unconditional cache size: 2776, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, 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.0s, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, independent: 132, independent conditional: 13, independent unconditional: 119, 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: 153, independent: 126, independent conditional: 0, independent unconditional: 126, 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: 45, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 39, dependent conditional: 9, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 153, unknown conditional: 15, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 132, Positive conditional cache size: 13, Positive unconditional cache size: 119, 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.4s, 41 PlacesBefore, 40 PlacesAfterwards, 39 TransitionsBefore, 38 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 405, independent: 383, independent conditional: 383, 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: 405, independent: 383, independent conditional: 119, independent unconditional: 264, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 405, independent: 383, independent conditional: 45, independent unconditional: 338, 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: 405, independent: 383, independent conditional: 45, independent unconditional: 338, 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: 12, independent: 11, independent conditional: 1, independent unconditional: 10, 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: 12, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 405, independent: 372, independent conditional: 44, independent unconditional: 328, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 12, unknown conditional: 1, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 185, Positive conditional cache size: 16, Positive unconditional cache size: 169, 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: 76, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 375, independent conditional: 375, independent unconditional: 0, dependent: 23, dependent conditional: 23, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398, independent: 375, independent conditional: 109, independent unconditional: 266, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 398, independent: 375, independent conditional: 97, independent unconditional: 278, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 398, independent: 375, independent conditional: 97, independent unconditional: 278, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 23, independent conditional: 7, independent unconditional: 16, 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: 23, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 398, independent: 352, independent conditional: 90, independent unconditional: 262, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 23, unknown conditional: 7, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 208, Positive conditional cache size: 23, Positive unconditional cache size: 185, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 49 PlacesBefore, 49 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 676 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 459, independent: 430, independent conditional: 430, 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: 459, independent: 430, independent conditional: 150, independent unconditional: 280, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 459, independent: 430, independent conditional: 139, independent unconditional: 291, 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: 459, independent: 430, independent conditional: 139, independent unconditional: 291, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 459, independent: 424, independent conditional: 133, independent unconditional: 291, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 214, Positive conditional cache size: 29, Positive unconditional cache size: 185, 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: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 57 TransitionsBefore, 57 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 427, independent: 398, independent conditional: 398, 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: 427, independent: 398, independent conditional: 118, independent unconditional: 280, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 427, independent: 398, independent conditional: 107, independent unconditional: 291, 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: 427, independent: 398, independent conditional: 107, independent unconditional: 291, 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: 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: 427, independent: 398, independent conditional: 107, independent unconditional: 291, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 214, Positive conditional cache size: 29, Positive unconditional cache size: 185, 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: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 54 PlacesBefore, 54 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 821, independent: 776, independent conditional: 776, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 821, independent: 776, independent conditional: 250, independent unconditional: 526, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 821, independent: 776, independent conditional: 241, independent unconditional: 535, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 821, independent: 776, independent conditional: 241, independent unconditional: 535, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 20, independent conditional: 10, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 821, independent: 756, independent conditional: 231, independent unconditional: 525, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 20, unknown conditional: 10, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 234, Positive conditional cache size: 39, Positive unconditional cache size: 195, 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: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 944, independent: 882, independent conditional: 882, independent unconditional: 0, dependent: 62, dependent conditional: 62, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 944, independent: 882, independent conditional: 357, independent unconditional: 525, dependent: 62, dependent conditional: 13, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 944, independent: 882, independent conditional: 301, independent unconditional: 581, dependent: 62, dependent conditional: 13, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 944, independent: 882, independent conditional: 301, independent unconditional: 581, dependent: 62, dependent conditional: 13, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 944, independent: 877, independent conditional: 298, independent unconditional: 579, dependent: 61, dependent conditional: 12, dependent unconditional: 49, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 262, Positive cache size: 239, Positive conditional cache size: 42, Positive unconditional cache size: 197, Negative cache size: 23, Negative conditional cache size: 3, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1024, independent: 953, independent conditional: 953, independent unconditional: 0, dependent: 71, dependent conditional: 71, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1024, independent: 953, independent conditional: 407, independent unconditional: 546, dependent: 71, dependent conditional: 22, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1046, independent: 953, independent conditional: 323, independent unconditional: 630, dependent: 93, dependent conditional: 44, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1046, independent: 953, independent conditional: 323, independent unconditional: 630, dependent: 93, dependent conditional: 44, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1046, independent: 950, independent conditional: 320, independent unconditional: 630, dependent: 92, dependent conditional: 43, dependent unconditional: 49, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 242, Positive conditional cache size: 45, Positive unconditional cache size: 197, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 84, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 60 PlacesBefore, 60 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 970 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 408, independent: 381, independent conditional: 381, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 408, independent: 381, independent conditional: 147, independent unconditional: 234, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 408, independent: 381, independent conditional: 144, independent unconditional: 237, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 408, independent: 381, independent conditional: 144, independent unconditional: 237, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 408, independent: 380, independent conditional: 144, independent unconditional: 236, dependent: 27, dependent conditional: 6, dependent unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 243, Positive conditional cache size: 45, Positive unconditional cache size: 198, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 63 PlacesBefore, 64 PlacesAfterwards, 75 TransitionsBefore, 76 TransitionsAfterwards, 1070 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 981, independent: 927, independent conditional: 927, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 981, independent: 927, independent conditional: 424, independent unconditional: 503, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 981, independent: 927, independent conditional: 366, independent unconditional: 561, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 981, independent: 927, independent conditional: 366, independent unconditional: 561, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 5, independent unconditional: 11, 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: 16, independent: 16, independent conditional: 0, independent unconditional: 16, 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: 981, independent: 911, independent conditional: 361, independent unconditional: 550, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 16, unknown conditional: 5, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 292, Positive cache size: 268, Positive conditional cache size: 50, Positive unconditional cache size: 218, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 58, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 66 PlacesBefore, 66 PlacesAfterwards, 78 TransitionsBefore, 77 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1051, independent: 997, independent conditional: 997, independent unconditional: 0, dependent: 54, dependent conditional: 54, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1051, independent: 997, independent conditional: 528, independent unconditional: 469, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1051, independent: 997, independent conditional: 462, independent unconditional: 535, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1051, independent: 997, independent conditional: 462, independent unconditional: 535, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1051, independent: 992, independent conditional: 458, independent unconditional: 534, dependent: 54, dependent conditional: 12, dependent unconditional: 42, unknown: 5, unknown conditional: 4, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 273, Positive conditional cache size: 54, Positive unconditional cache size: 219, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 66, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 68 PlacesBefore, 66 PlacesAfterwards, 77 TransitionsBefore, 72 TransitionsAfterwards, 970 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 849, independent: 810, independent conditional: 810, independent unconditional: 0, dependent: 39, dependent conditional: 39, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 849, independent: 810, independent conditional: 486, independent unconditional: 324, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 849, independent: 810, independent conditional: 414, independent unconditional: 396, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 849, independent: 810, independent conditional: 414, independent unconditional: 396, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 6, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 849, independent: 802, independent conditional: 408, independent unconditional: 394, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 302, Positive conditional cache size: 60, Positive unconditional cache size: 242, Negative cache size: 24, Negative conditional cache size: 4, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 72, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 66 PlacesBefore, 65 PlacesAfterwards, 67 TransitionsBefore, 66 TransitionsAfterwards, 862 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 424, independent: 414, independent conditional: 414, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 424, independent: 414, independent conditional: 267, independent unconditional: 147, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 424, independent: 414, independent conditional: 247, independent unconditional: 167, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 424, independent: 414, independent conditional: 247, independent unconditional: 167, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 18, independent conditional: 11, independent unconditional: 7, 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: 19, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 424, independent: 396, independent conditional: 236, independent unconditional: 160, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 19, unknown conditional: 11, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 466, Positive cache size: 441, Positive conditional cache size: 81, Positive unconditional cache size: 360, Negative cache size: 25, Negative conditional cache size: 4, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 67 PlacesBefore, 66 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 186, independent: 182, independent conditional: 182, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 186, independent: 182, independent conditional: 150, independent unconditional: 32, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 186, independent: 182, independent conditional: 136, independent unconditional: 46, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 186, independent: 182, independent conditional: 136, independent unconditional: 46, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 9, independent conditional: 3, independent unconditional: 6, 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: 10, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 186, independent: 173, independent conditional: 133, independent unconditional: 40, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 10, unknown conditional: 3, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 477, Positive conditional cache size: 86, Positive unconditional cache size: 391, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 65 PlacesBefore, 64 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 418 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68, independent: 68, independent conditional: 68, 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: 68, independent: 68, independent conditional: 64, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68, independent: 68, independent conditional: 43, independent unconditional: 25, 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: 68, independent: 68, independent conditional: 43, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68, independent: 68, independent conditional: 43, independent unconditional: 25, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 529, Positive cache size: 503, Positive conditional cache size: 87, Positive unconditional cache size: 416, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-2, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=1, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 [L753] 1 x = 1 [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L883] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 855]: 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: 853]: 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: 851]: 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, 165 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: 34.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 599 mSDsluCounter, 33 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1555 IncrementalHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 20 mSDtfsCounter, 1555 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=801occurred in iteration=8, InterpolantAutomatonStates: 64, 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.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:30:07,482 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...