/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/mix038.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:25:30,026 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:25:30,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:25:30,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:25:30,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:25:30,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:25:30,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:25:30,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:25:30,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:25:30,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:25:30,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:25:30,073 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:25:30,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:25:30,074 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:25:30,078 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:25:30,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:25:30,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:25:30,083 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:25:30,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:25:30,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:25:30,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:25:30,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:25:30,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:25:30,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:25:30,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:25:30,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:25:30,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:25:30,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:25:30,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:25:30,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:25:30,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:25:30,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:25:30,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:25:30,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:25:30,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:25:30,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:25:30,110 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:25:30,110 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:25:30,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:25:30,111 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:25:30,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:25:30,112 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:25:30,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:25:30,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:25:30,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:25:30,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:25:30,146 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:25:30,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:25:30,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:25:30,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:25:30,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:25:30,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:25:30,148 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:25:30,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:30,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:25:30,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:25:30,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:25:30,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:25:30,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:25:30,150 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:25:30,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:25:30,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:25:30,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:25:30,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:25:30,444 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:25:30,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-06 06:25:31,608 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:25:31,908 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:25:31,908 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-06 06:25:31,929 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187d3ca5b/9504ab52831c4877b062bea5a6e028c5/FLAGefb6b7500 [2022-12-06 06:25:31,942 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/187d3ca5b/9504ab52831c4877b062bea5a6e028c5 [2022-12-06 06:25:31,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:25:31,945 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:25:31,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:31,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:25:31,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:25:31,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:31" (1/1) ... [2022-12-06 06:25:31,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db5e7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:31, skipping insertion in model container [2022-12-06 06:25:31,950 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:25:31" (1/1) ... [2022-12-06 06:25:31,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:25:31,985 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:25:32,123 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/mix038.opt.i[944,957] [2022-12-06 06:25:32,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,242 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,260 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,276 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,277 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:32,294 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:25:32,303 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/mix038.opt.i[944,957] [2022-12-06 06:25:32,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,327 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,328 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,345 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,347 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,348 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:25:32,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:25:32,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:25:32,384 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:25:32,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32 WrapperNode [2022-12-06 06:25:32,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:25:32,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:32,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:25:32,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:25:32,390 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:25:32" (1/1) ... [2022-12-06 06:25:32,415 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:25:32" (1/1) ... [2022-12-06 06:25:32,441 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2022-12-06 06:25:32,441 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:25:32,442 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:25:32,442 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:25:32,442 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:25:32,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,475 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:25:32,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:25:32,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:25:32,478 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:25:32,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (1/1) ... [2022-12-06 06:25:32,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:25:32,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:25:32,545 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:25:32,563 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:25:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:25:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:25:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:25:32,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:25:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:25:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:25:32,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:25:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:25:32,585 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:25:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:25:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:25:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:25:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:25:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:25:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:25:32,587 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:25:32,716 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:25:32,718 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:25:32,917 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:25:33,025 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:25:33,026 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:25:33,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:33 BoogieIcfgContainer [2022-12-06 06:25:33,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:25:33,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:25:33,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:25:33,031 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:25:33,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:25:31" (1/3) ... [2022-12-06 06:25:33,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a19bab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:33, skipping insertion in model container [2022-12-06 06:25:33,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:25:32" (2/3) ... [2022-12-06 06:25:33,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a19bab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:25:33, skipping insertion in model container [2022-12-06 06:25:33,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:25:33" (3/3) ... [2022-12-06 06:25:33,037 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2022-12-06 06:25:33,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:25:33,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:25:33,050 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:25:33,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:25:33,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 06:25:33,206 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 06:25:33,207 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:25:33,212 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-06 06:25:33,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-06 06:25:33,216 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:33,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 06:25:33,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-06 06:25:33,285 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-06 06:25:33,286 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:33,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-06 06:25:33,289 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-06 06:25:33,289 INFO L188 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-06 06:25:36,565 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 06:25:36,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:25:36,610 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;@31d3c9de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:25:36,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:25:36,625 INFO L130 PetriNetUnfolder]: 0/11 cut-off events. [2022-12-06 06:25:36,625 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:36,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:36,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:36,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:36,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1774290354, now seen corresponding path program 1 times [2022-12-06 06:25:36,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:36,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845740258] [2022-12-06 06:25:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:37,051 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:25:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845740258] [2022-12-06 06:25:37,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845740258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:37,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:37,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:25:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553931134] [2022-12-06 06:25:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:37,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:25:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:25:37,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:25:37,078 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2022-12-06 06:25:37,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:37,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:37,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2022-12-06 06:25:37,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:37,288 INFO L130 PetriNetUnfolder]: 777/1242 cut-off events. [2022-12-06 06:25:37,288 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:25:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2447 conditions, 1242 events. 777/1242 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5910 event pairs, 129 based on Foata normal form. 0/1121 useless extension candidates. Maximal degree in co-relation 2436. Up to 937 conditions per place. [2022-12-06 06:25:37,299 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 24 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2022-12-06 06:25:37,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-06 06:25:37,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-06 06:25:37,310 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2022-12-06 06:25:37,311 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 41 transitions. [2022-12-06 06:25:37,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-06 06:25:37,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:25:37,314 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2022-12-06 06:25:37,316 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2022-12-06 06:25:37,318 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:25:37,318 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:37,319 INFO L89 Accepts]: Start accepts. Operand has 31 places, 20 transitions, 50 flow [2022-12-06 06:25:37,321 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:37,321 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:37,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 20 transitions, 50 flow [2022-12-06 06:25:37,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 20 transitions, 50 flow [2022-12-06 06:25:37,332 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-06 06:25:37,332 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:25:37,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:25:37,332 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 20 transitions, 50 flow [2022-12-06 06:25:37,332 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 06:25:37,545 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:37,548 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 230 [2022-12-06 06:25:37,548 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 48 flow [2022-12-06 06:25:37,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:37,548 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:37,548 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:37,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:25:37,551 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:37,552 INFO L85 PathProgramCache]: Analyzing trace with hash -8959663, now seen corresponding path program 1 times [2022-12-06 06:25:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:37,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071206784] [2022-12-06 06:25:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:25:37,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:37,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071206784] [2022-12-06 06:25:37,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071206784] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:37,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:37,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:25:37,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017090385] [2022-12-06 06:25:37,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:37,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:25:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:37,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:25:37,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:25:37,766 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:25:37,766 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 48 flow. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:37,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:37,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:25:37,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:37,959 INFO L130 PetriNetUnfolder]: 946/1467 cut-off events. [2022-12-06 06:25:37,959 INFO L131 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2022-12-06 06:25:37,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3076 conditions, 1467 events. 946/1467 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6498 event pairs, 302 based on Foata normal form. 42/1509 useless extension candidates. Maximal degree in co-relation 3066. Up to 1061 conditions per place. [2022-12-06 06:25:37,968 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 27 selfloop transitions, 6 changer transitions 0/33 dead transitions. [2022-12-06 06:25:37,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 146 flow [2022-12-06 06:25:37,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:37,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 06:25:37,970 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2022-12-06 06:25:37,970 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 48 flow. Second operand 3 states and 34 transitions. [2022-12-06 06:25:37,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 146 flow [2022-12-06 06:25:37,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:37,973 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:37,973 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2022-12-06 06:25:37,974 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -4 predicate places. [2022-12-06 06:25:37,974 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:37,974 INFO L89 Accepts]: Start accepts. Operand has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:37,975 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:37,975 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:37,975 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:37,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:37,995 INFO L130 PetriNetUnfolder]: 48/153 cut-off events. [2022-12-06 06:25:37,995 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-12-06 06:25:37,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 153 events. 48/153 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 771 event pairs, 24 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 292. Up to 81 conditions per place. [2022-12-06 06:25:37,997 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:37,997 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 06:25:37,999 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:38,000 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-06 06:25:38,000 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 90 flow [2022-12-06 06:25:38,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:38,000 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:38,000 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:38,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:25:38,001 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:38,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash -277749403, now seen corresponding path program 1 times [2022-12-06 06:25:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:38,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353473951] [2022-12-06 06:25:38,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:38,155 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:25:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353473951] [2022-12-06 06:25:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353473951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:38,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:38,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:25:38,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644529561] [2022-12-06 06:25:38,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:38,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:25:38,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:38,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:25:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:25:38,157 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:25:38,157 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:25:38,158 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:38,158 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:25:38,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:38,298 INFO L130 PetriNetUnfolder]: 723/1183 cut-off events. [2022-12-06 06:25:38,298 INFO L131 PetriNetUnfolder]: For 513/515 co-relation queries the response was YES. [2022-12-06 06:25:38,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2969 conditions, 1183 events. 723/1183 cut-off events. For 513/515 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5511 event pairs, 187 based on Foata normal form. 12/1185 useless extension candidates. Maximal degree in co-relation 2957. Up to 847 conditions per place. [2022-12-06 06:25:38,304 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 25 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-06 06:25:38,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 172 flow [2022-12-06 06:25:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:25:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:25:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-12-06 06:25:38,305 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2022-12-06 06:25:38,306 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 90 flow. Second operand 3 states and 31 transitions. [2022-12-06 06:25:38,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 172 flow [2022-12-06 06:25:38,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:38,309 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,309 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-06 06:25:38,310 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2022-12-06 06:25:38,310 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:38,310 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,311 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:38,311 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:38,311 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,326 INFO L130 PetriNetUnfolder]: 39/136 cut-off events. [2022-12-06 06:25:38,326 INFO L131 PetriNetUnfolder]: For 18/29 co-relation queries the response was YES. [2022-12-06 06:25:38,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 136 events. 39/136 cut-off events. For 18/29 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 647 event pairs, 14 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 248. Up to 68 conditions per place. [2022-12-06 06:25:38,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,327 INFO L188 LiptonReduction]: Number of co-enabled transitions 188 [2022-12-06 06:25:38,329 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:38,330 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-06 06:25:38,330 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 89 flow [2022-12-06 06:25:38,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:25:38,331 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:38,331 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:38,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:25:38,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:38,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash -277747977, now seen corresponding path program 1 times [2022-12-06 06:25:38,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:38,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3710789] [2022-12-06 06:25:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:38,455 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:25:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:38,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3710789] [2022-12-06 06:25:38,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3710789] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:38,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:38,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:25:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098148643] [2022-12-06 06:25:38,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:38,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:38,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:38,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:38,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:25:38,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 89 flow. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:38,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:38,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:25:38,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:38,682 INFO L130 PetriNetUnfolder]: 878/1365 cut-off events. [2022-12-06 06:25:38,682 INFO L131 PetriNetUnfolder]: For 401/401 co-relation queries the response was YES. [2022-12-06 06:25:38,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3501 conditions, 1365 events. 878/1365 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5982 event pairs, 204 based on Foata normal form. 8/1373 useless extension candidates. Maximal degree in co-relation 3488. Up to 927 conditions per place. [2022-12-06 06:25:38,690 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 36 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2022-12-06 06:25:38,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 244 flow [2022-12-06 06:25:38,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-06 06:25:38,693 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2022-12-06 06:25:38,693 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 89 flow. Second operand 4 states and 45 transitions. [2022-12-06 06:25:38,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 244 flow [2022-12-06 06:25:38,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:38,695 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2022-12-06 06:25:38,696 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-06 06:25:38,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:38,696 INFO L89 Accepts]: Start accepts. Operand has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,696 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:38,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:38,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,707 INFO L130 PetriNetUnfolder]: 33/122 cut-off events. [2022-12-06 06:25:38,707 INFO L131 PetriNetUnfolder]: For 71/82 co-relation queries the response was YES. [2022-12-06 06:25:38,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 122 events. 33/122 cut-off events. For 71/82 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 561 event pairs, 13 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 283. Up to 60 conditions per place. [2022-12-06 06:25:38,708 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,708 INFO L188 LiptonReduction]: Number of co-enabled transitions 216 [2022-12-06 06:25:38,709 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:38,710 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 06:25:38,710 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 138 flow [2022-12-06 06:25:38,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:38,710 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:38,710 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:38,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:25:38,711 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:38,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:38,711 INFO L85 PathProgramCache]: Analyzing trace with hash -20295325, now seen corresponding path program 1 times [2022-12-06 06:25:38,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:38,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853439215] [2022-12-06 06:25:38,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:38,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:38,809 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:25:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:38,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853439215] [2022-12-06 06:25:38,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853439215] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:38,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:38,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096771786] [2022-12-06 06:25:38,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:38,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:38,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:38,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:38,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:25:38,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:38,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:38,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:25:38,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:38,943 INFO L130 PetriNetUnfolder]: 583/994 cut-off events. [2022-12-06 06:25:38,943 INFO L131 PetriNetUnfolder]: For 713/744 co-relation queries the response was YES. [2022-12-06 06:25:38,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 994 events. 583/994 cut-off events. For 713/744 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4936 event pairs, 105 based on Foata normal form. 113/1087 useless extension candidates. Maximal degree in co-relation 2810. Up to 602 conditions per place. [2022-12-06 06:25:38,947 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 45 selfloop transitions, 7 changer transitions 14/71 dead transitions. [2022-12-06 06:25:38,947 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 71 transitions, 460 flow [2022-12-06 06:25:38,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:25:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:25:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-12-06 06:25:38,949 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6105263157894737 [2022-12-06 06:25:38,949 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 138 flow. Second operand 5 states and 58 transitions. [2022-12-06 06:25:38,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 71 transitions, 460 flow [2022-12-06 06:25:38,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 71 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:25:38,951 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 192 flow [2022-12-06 06:25:38,951 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2022-12-06 06:25:38,952 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 06:25:38,952 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:38,952 INFO L89 Accepts]: Start accepts. Operand has 41 places, 34 transitions, 192 flow [2022-12-06 06:25:38,953 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:38,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:38,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 34 transitions, 192 flow [2022-12-06 06:25:38,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 192 flow [2022-12-06 06:25:38,977 INFO L130 PetriNetUnfolder]: 135/342 cut-off events. [2022-12-06 06:25:38,977 INFO L131 PetriNetUnfolder]: For 282/346 co-relation queries the response was YES. [2022-12-06 06:25:38,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 342 events. 135/342 cut-off events. For 282/346 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2124 event pairs, 61 based on Foata normal form. 8/323 useless extension candidates. Maximal degree in co-relation 980. Up to 190 conditions per place. [2022-12-06 06:25:38,980 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 34 transitions, 192 flow [2022-12-06 06:25:38,980 INFO L188 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-06 06:25:39,019 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:39,019 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 67 [2022-12-06 06:25:39,020 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 186 flow [2022-12-06 06:25:39,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,020 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:39,020 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:39,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:25:39,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:39,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:39,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1262605241, now seen corresponding path program 1 times [2022-12-06 06:25:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:39,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112394790] [2022-12-06 06:25:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:39,137 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:25:39,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:39,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112394790] [2022-12-06 06:25:39,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112394790] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:39,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:39,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:39,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137597048] [2022-12-06 06:25:39,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:39,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:39,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:39,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:39,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:39,139 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 06:25:39,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 186 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:39,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 06:25:39,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:39,269 INFO L130 PetriNetUnfolder]: 608/1049 cut-off events. [2022-12-06 06:25:39,269 INFO L131 PetriNetUnfolder]: For 1326/1326 co-relation queries the response was YES. [2022-12-06 06:25:39,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 1049 events. 608/1049 cut-off events. For 1326/1326 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4832 event pairs, 202 based on Foata normal form. 23/1072 useless extension candidates. Maximal degree in co-relation 3840. Up to 530 conditions per place. [2022-12-06 06:25:39,274 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 39 selfloop transitions, 8 changer transitions 3/50 dead transitions. [2022-12-06 06:25:39,274 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 352 flow [2022-12-06 06:25:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:39,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:39,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-06 06:25:39,275 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 06:25:39,275 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 186 flow. Second operand 4 states and 40 transitions. [2022-12-06 06:25:39,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 352 flow [2022-12-06 06:25:39,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 341 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:39,279 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,280 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=191, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2022-12-06 06:25:39,280 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 06:25:39,280 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:39,280 INFO L89 Accepts]: Start accepts. Operand has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,281 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:39,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:39,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,308 INFO L130 PetriNetUnfolder]: 149/358 cut-off events. [2022-12-06 06:25:39,308 INFO L131 PetriNetUnfolder]: For 365/398 co-relation queries the response was YES. [2022-12-06 06:25:39,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 358 events. 149/358 cut-off events. For 365/398 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2122 event pairs, 73 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 989. Up to 213 conditions per place. [2022-12-06 06:25:39,311 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,311 INFO L188 LiptonReduction]: Number of co-enabled transitions 238 [2022-12-06 06:25:39,312 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:25:39,313 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-06 06:25:39,313 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 191 flow [2022-12-06 06:25:39,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,313 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:39,313 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:39,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:25:39,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash -90088123, now seen corresponding path program 1 times [2022-12-06 06:25:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:39,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960772684] [2022-12-06 06:25:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:39,434 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:25:39,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:39,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960772684] [2022-12-06 06:25:39,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960772684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:39,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:39,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:25:39,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112900257] [2022-12-06 06:25:39,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:39,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:25:39,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:39,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:25:39,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:25:39,436 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:25:39,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:39,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:25:39,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:39,571 INFO L130 PetriNetUnfolder]: 358/685 cut-off events. [2022-12-06 06:25:39,572 INFO L131 PetriNetUnfolder]: For 792/805 co-relation queries the response was YES. [2022-12-06 06:25:39,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2450 conditions, 685 events. 358/685 cut-off events. For 792/805 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3450 event pairs, 50 based on Foata normal form. 83/758 useless extension candidates. Maximal degree in co-relation 2429. Up to 293 conditions per place. [2022-12-06 06:25:39,575 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 41 selfloop transitions, 8 changer transitions 27/81 dead transitions. [2022-12-06 06:25:39,575 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 81 transitions, 621 flow [2022-12-06 06:25:39,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:25:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:25:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 06:25:39,576 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2022-12-06 06:25:39,576 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 191 flow. Second operand 6 states and 70 transitions. [2022-12-06 06:25:39,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 81 transitions, 621 flow [2022-12-06 06:25:39,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 81 transitions, 567 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-06 06:25:39,579 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 228 flow [2022-12-06 06:25:39,580 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2022-12-06 06:25:39,580 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-06 06:25:39,580 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:39,580 INFO L89 Accepts]: Start accepts. Operand has 47 places, 34 transitions, 228 flow [2022-12-06 06:25:39,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:39,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:39,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 228 flow [2022-12-06 06:25:39,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 228 flow [2022-12-06 06:25:39,622 INFO L130 PetriNetUnfolder]: 58/211 cut-off events. [2022-12-06 06:25:39,623 INFO L131 PetriNetUnfolder]: For 407/530 co-relation queries the response was YES. [2022-12-06 06:25:39,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 211 events. 58/211 cut-off events. For 407/530 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1201 event pairs, 15 based on Foata normal form. 10/217 useless extension candidates. Maximal degree in co-relation 780. Up to 123 conditions per place. [2022-12-06 06:25:39,624 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 228 flow [2022-12-06 06:25:39,624 INFO L188 LiptonReduction]: Number of co-enabled transitions 236 [2022-12-06 06:25:39,654 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:25:39,654 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 74 [2022-12-06 06:25:39,654 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 220 flow [2022-12-06 06:25:39,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:39,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:39,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:25:39,655 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:39,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:39,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1251977925, now seen corresponding path program 1 times [2022-12-06 06:25:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:39,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689226551] [2022-12-06 06:25:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:39,782 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:25:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:39,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689226551] [2022-12-06 06:25:39,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689226551] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:39,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:39,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:25:39,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988841096] [2022-12-06 06:25:39,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:39,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:25:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:39,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:25:39,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:25:39,784 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2022-12-06 06:25:39,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:39,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:39,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2022-12-06 06:25:39,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:39,883 INFO L130 PetriNetUnfolder]: 194/399 cut-off events. [2022-12-06 06:25:39,883 INFO L131 PetriNetUnfolder]: For 709/717 co-relation queries the response was YES. [2022-12-06 06:25:39,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 399 events. 194/399 cut-off events. For 709/717 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1801 event pairs, 40 based on Foata normal form. 32/427 useless extension candidates. Maximal degree in co-relation 1562. Up to 161 conditions per place. [2022-12-06 06:25:39,885 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 34 selfloop transitions, 10 changer transitions 17/65 dead transitions. [2022-12-06 06:25:39,885 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 503 flow [2022-12-06 06:25:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:25:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:25:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-12-06 06:25:39,886 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2022-12-06 06:25:39,886 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 220 flow. Second operand 7 states and 64 transitions. [2022-12-06 06:25:39,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 503 flow [2022-12-06 06:25:39,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 447 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-06 06:25:39,889 INFO L231 Difference]: Finished difference. Result has 48 places, 30 transitions, 188 flow [2022-12-06 06:25:39,890 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=48, PETRI_TRANSITIONS=30} [2022-12-06 06:25:39,890 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-06 06:25:39,890 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:39,890 INFO L89 Accepts]: Start accepts. Operand has 48 places, 30 transitions, 188 flow [2022-12-06 06:25:39,891 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:39,891 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:39,891 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 30 transitions, 188 flow [2022-12-06 06:25:39,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 30 transitions, 188 flow [2022-12-06 06:25:39,896 INFO L130 PetriNetUnfolder]: 16/60 cut-off events. [2022-12-06 06:25:39,897 INFO L131 PetriNetUnfolder]: For 85/91 co-relation queries the response was YES. [2022-12-06 06:25:39,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 60 events. 16/60 cut-off events. For 85/91 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 154 event pairs, 2 based on Foata normal form. 1/60 useless extension candidates. Maximal degree in co-relation 180. Up to 19 conditions per place. [2022-12-06 06:25:39,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 30 transitions, 188 flow [2022-12-06 06:25:39,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 114 [2022-12-06 06:25:40,208 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:25:40,208 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 318 [2022-12-06 06:25:40,209 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 184 flow [2022-12-06 06:25:40,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:40,209 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:40,209 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:40,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:25:40,209 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:40,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:40,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1165319704, now seen corresponding path program 1 times [2022-12-06 06:25:40,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:40,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617028293] [2022-12-06 06:25:40,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:40,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:40,331 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:25:40,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:40,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617028293] [2022-12-06 06:25:40,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617028293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:40,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:40,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:25:40,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237338695] [2022-12-06 06:25:40,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:40,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:25:40,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:25:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:25:40,333 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 17 [2022-12-06 06:25:40,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:40,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:40,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 17 [2022-12-06 06:25:40,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:40,423 INFO L130 PetriNetUnfolder]: 107/220 cut-off events. [2022-12-06 06:25:40,424 INFO L131 PetriNetUnfolder]: For 511/513 co-relation queries the response was YES. [2022-12-06 06:25:40,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 886 conditions, 220 events. 107/220 cut-off events. For 511/513 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 778 event pairs, 20 based on Foata normal form. 3/223 useless extension candidates. Maximal degree in co-relation 863. Up to 130 conditions per place. [2022-12-06 06:25:40,425 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 23 selfloop transitions, 1 changer transitions 24/49 dead transitions. [2022-12-06 06:25:40,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 49 transitions, 408 flow [2022-12-06 06:25:40,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:25:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:25:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-12-06 06:25:40,426 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-06 06:25:40,426 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 184 flow. Second operand 4 states and 35 transitions. [2022-12-06 06:25:40,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 49 transitions, 408 flow [2022-12-06 06:25:40,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 330 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-12-06 06:25:40,428 INFO L231 Difference]: Finished difference. Result has 41 places, 23 transitions, 121 flow [2022-12-06 06:25:40,428 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=41, PETRI_TRANSITIONS=23} [2022-12-06 06:25:40,429 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-12-06 06:25:40,429 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:40,429 INFO L89 Accepts]: Start accepts. Operand has 41 places, 23 transitions, 121 flow [2022-12-06 06:25:40,429 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:40,430 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:40,430 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 23 transitions, 121 flow [2022-12-06 06:25:40,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 121 flow [2022-12-06 06:25:40,434 INFO L130 PetriNetUnfolder]: 6/34 cut-off events. [2022-12-06 06:25:40,435 INFO L131 PetriNetUnfolder]: For 87/93 co-relation queries the response was YES. [2022-12-06 06:25:40,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 34 events. 6/34 cut-off events. For 87/93 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 4/37 useless extension candidates. Maximal degree in co-relation 89. Up to 10 conditions per place. [2022-12-06 06:25:40,435 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 121 flow [2022-12-06 06:25:40,435 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 06:25:40,437 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [312] L748-->L751: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0] and [390] $Ultimate##0-->L763: Formula: (and (= v_~x~0_20 2) (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0] [2022-12-06 06:25:40,586 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:25:40,587 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 06:25:40,587 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 111 flow [2022-12-06 06:25:40,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:40,587 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:40,587 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:40,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:25:40,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash -614957212, now seen corresponding path program 1 times [2022-12-06 06:25:40,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:40,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675450641] [2022-12-06 06:25:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:25:40,971 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:25:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:25:40,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675450641] [2022-12-06 06:25:40,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675450641] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:25:40,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:25:40,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:25:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455074205] [2022-12-06 06:25:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:25:40,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:25:40,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:25:40,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:25:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:25:40,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 06:25:40,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 111 flow. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:40,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:25:40,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 06:25:40,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:25:41,027 INFO L130 PetriNetUnfolder]: 22/58 cut-off events. [2022-12-06 06:25:41,027 INFO L131 PetriNetUnfolder]: For 132/132 co-relation queries the response was YES. [2022-12-06 06:25:41,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 58 events. 22/58 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 1 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 208. Up to 26 conditions per place. [2022-12-06 06:25:41,027 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 20 selfloop transitions, 4 changer transitions 11/35 dead transitions. [2022-12-06 06:25:41,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 270 flow [2022-12-06 06:25:41,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:25:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:25:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-12-06 06:25:41,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-06 06:25:41,028 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 111 flow. Second operand 6 states and 22 transitions. [2022-12-06 06:25:41,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 270 flow [2022-12-06 06:25:41,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 243 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-12-06 06:25:41,029 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 104 flow [2022-12-06 06:25:41,030 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2022-12-06 06:25:41,030 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-06 06:25:41,030 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:25:41,030 INFO L89 Accepts]: Start accepts. Operand has 36 places, 20 transitions, 104 flow [2022-12-06 06:25:41,030 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:25:41,031 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:25:41,031 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 20 transitions, 104 flow [2022-12-06 06:25:41,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 20 transitions, 104 flow [2022-12-06 06:25:41,034 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 06:25:41,034 INFO L131 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2022-12-06 06:25:41,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83 conditions, 27 events. 6/27 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 1/28 useless extension candidates. Maximal degree in co-relation 70. Up to 10 conditions per place. [2022-12-06 06:25:41,034 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 20 transitions, 104 flow [2022-12-06 06:25:41,034 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-06 06:25:41,659 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [442] L809-->P2EXIT: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_139 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_316 256) 0)))) (let ((.cse2 (and .cse5 .cse0)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_273 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_317 256) 0))))) (and (= |v_P2Thread1of1ForFork0_#res#1.base_29| 0) (= |v_P2Thread1of1ForFork0_#res#1.offset_29| 0) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd3~0_138 256) 0)) .cse0) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_272 256) 0)))) 0 v_~y$r_buff1_thd3~0_97) v_~y$r_buff1_thd3~0_96) (= v_~y$w_buff1_used~0_272 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_273)) (= v_~__unbuffered_cnt~0_159 (+ v_~__unbuffered_cnt~0_160 1)) (= (ite .cse2 0 v_~y$r_buff0_thd3~0_139) v_~y$r_buff0_thd3~0_138) (= v_~y~0_240 (ite .cse4 v_~y$w_buff0~0_199 (ite .cse3 v_~y$w_buff1~0_156 v_~y~0_241))) (= (ite .cse4 0 v_~y$w_buff0_used~0_317) v_~y$w_buff0_used~0_316)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_97, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_317, ~y$w_buff1~0=v_~y$w_buff1~0_156, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_139, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_160, ~y~0=v_~y~0_241, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_273} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_96, P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_29|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_316, ~y$w_buff1~0=v_~y$w_buff1~0_156, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_138, ~y$w_buff0~0=v_~y$w_buff0~0_199, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, ~y~0=v_~y~0_240, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_29|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_272} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res#1.offset, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~y~0, P2Thread1of1ForFork0_#res#1.base, ~y$w_buff1_used~0] and [438] L838-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$r_buff1_thd0~0_142 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_144 256) 0))) (.cse3 (not (= (mod v_~y$w_buff0_used~0_308 256) 0)))) (let ((.cse1 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_309 256) 0)))) (.cse2 (and .cse4 (not (= (mod v_~y$w_buff1_used~0_267 256) 0))))) (and (= (mod v_~main$tmp_guard1~0_71 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_48|) (= v_~y$w_buff0_used~0_308 (ite .cse0 0 v_~y$w_buff0_used~0_309)) (= v_~main$tmp_guard0~0_72 (ite (= (ite (= v_~__unbuffered_cnt~0_157 3) 1 0) 0) 0 1)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| 0)) (= v_~y$w_buff1_used~0_266 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_267)) (= v_~y$r_buff0_thd0~0_143 (ite .cse1 0 v_~y$r_buff0_thd0~0_144)) (= v_~y~0_236 (ite .cse0 v_~y$w_buff0~0_193 (ite .cse2 v_~y$w_buff1~0_152 v_~y~0_237))) (= v_~main$tmp_guard1~0_71 (ite (= (ite (not (and (= v_~__unbuffered_p2_EBX~0_72 0) (= v_~__unbuffered_p2_EAX~0_72 1) (= v_~__unbuffered_p1_EAX~0_97 0) (= v_~x~0_94 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_58| 0) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_97| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_48| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_58|) (= (mod v_~main$tmp_guard0~0_72 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|) (= v_~y$r_buff1_thd0~0_141 (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd0~0_143 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_266 256) 0)))) 0 v_~y$r_buff1_thd0~0_142))))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_72, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_309, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_193, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y~0=v_~y~0_237, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_267} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_58|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_72, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_39|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_308, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_51|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_71, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_48|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_152, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_143, ~y$w_buff0~0=v_~y$w_buff0~0_193, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_97|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_72, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_157, ~y~0=v_~y~0_236, ~x~0=v_~x~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_266, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_79|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~nondet10#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] [2022-12-06 06:25:41,991 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:25:41,992 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 962 [2022-12-06 06:25:41,992 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 124 flow [2022-12-06 06:25:41,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:25:41,992 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:25:41,992 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:41,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:25:41,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-06 06:25:41,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:25:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 469385489, now seen corresponding path program 1 times [2022-12-06 06:25:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:25:41,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178054581] [2022-12-06 06:25:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:25:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:25:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:25:42,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:25:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:25:42,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:25:42,052 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:25:42,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:25:42,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-06 06:25:42,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:25:42,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-06 06:25:42,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-06 06:25:42,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:25:42,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:25:42,055 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:25:42,058 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:25:42,059 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:25:42,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:25:42 BasicIcfg [2022-12-06 06:25:42,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:25:42,122 INFO L158 Benchmark]: Toolchain (without parser) took 10176.95ms. Allocated memory was 202.4MB in the beginning and 470.8MB in the end (delta: 268.4MB). Free memory was 176.7MB in the beginning and 340.4MB in the end (delta: -163.7MB). Peak memory consumption was 106.2MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,122 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 178.7MB in the beginning and 178.7MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:25:42,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.57ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 150.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.81ms. Allocated memory is still 202.4MB. Free memory was 150.3MB in the beginning and 147.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,126 INFO L158 Benchmark]: Boogie Preprocessor took 35.96ms. Allocated memory is still 202.4MB. Free memory was 147.7MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,126 INFO L158 Benchmark]: RCFGBuilder took 549.33ms. Allocated memory is still 202.4MB. Free memory was 145.6MB in the beginning and 115.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,126 INFO L158 Benchmark]: TraceAbstraction took 9092.74ms. Allocated memory was 202.4MB in the beginning and 470.8MB in the end (delta: 268.4MB). Free memory was 115.2MB in the beginning and 340.4MB in the end (delta: -225.2MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2022-12-06 06:25:42,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 202.4MB. Free memory was 178.7MB in the beginning and 178.7MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.57ms. Allocated memory is still 202.4MB. Free memory was 176.5MB in the beginning and 150.3MB in the end (delta: 26.2MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.81ms. Allocated memory is still 202.4MB. Free memory was 150.3MB in the beginning and 147.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.96ms. Allocated memory is still 202.4MB. Free memory was 147.7MB in the beginning and 146.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 549.33ms. Allocated memory is still 202.4MB. Free memory was 145.6MB in the beginning and 115.7MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9092.74ms. Allocated memory was 202.4MB in the beginning and 470.8MB in the end (delta: 268.4MB). Free memory was 115.2MB in the beginning and 340.4MB in the end (delta: -225.2MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 115 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1339, independent: 1288, independent conditional: 1288, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1339, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1339, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1339, independent: 1288, independent conditional: 0, independent unconditional: 1288, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1146, independent: 1111, independent conditional: 0, independent unconditional: 1111, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1146, independent: 1097, independent conditional: 0, independent unconditional: 1097, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 49, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 221, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1339, independent: 177, independent conditional: 0, independent unconditional: 177, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 1146, unknown conditional: 0, unknown unconditional: 1146] , Statistics on independence cache: Total cache size (in pairs): 1751, Positive cache size: 1716, Positive conditional cache size: 0, Positive unconditional cache size: 1716, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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.2s, 29 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 134, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 171, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 171, independent: 134, independent conditional: 6, independent unconditional: 128, dependent: 37, dependent conditional: 4, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 89, independent: 72, independent conditional: 6, independent unconditional: 66, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 89, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 17, dependent conditional: 3, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 96, dependent conditional: 19, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 171, independent: 62, independent conditional: 0, independent unconditional: 62, dependent: 20, dependent conditional: 1, dependent unconditional: 19, unknown: 89, unknown conditional: 9, unknown unconditional: 80] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 72, Positive conditional cache size: 6, Positive unconditional cache size: 66, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 13, independent unconditional: 50, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 101, Positive cache size: 84, Positive conditional cache size: 6, Positive unconditional cache size: 78, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 15, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 65, independent unconditional: 0, dependent: 11, dependent conditional: 11, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 7, independent unconditional: 58, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 6, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 86, independent conditional: 26, independent unconditional: 60, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 86, independent conditional: 0, independent unconditional: 86, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 86, Positive conditional cache size: 6, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, 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.0s, 41 PlacesBefore, 41 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 118, independent: 106, independent conditional: 40, independent unconditional: 66, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, independent: 106, independent conditional: 28, independent unconditional: 78, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, independent: 106, independent conditional: 28, independent unconditional: 78, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 118, independent: 104, independent conditional: 27, independent unconditional: 77, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 88, Positive conditional cache size: 7, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, 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, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 34, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 14, independent unconditional: 20, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 39, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 39, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 39, independent: 34, independent conditional: 5, independent unconditional: 29, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 88, Positive conditional cache size: 7, Positive unconditional cache size: 81, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, 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, 46 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 33 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 102, independent: 84, independent conditional: 36, independent unconditional: 48, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 102, independent: 84, independent conditional: 12, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, independent: 84, independent conditional: 12, independent unconditional: 72, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, independent: 82, independent conditional: 11, independent unconditional: 71, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 90, Positive conditional cache size: 8, Positive unconditional cache size: 82, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 46 PlacesBefore, 44 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 86, independent conditional: 86, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 100, independent: 86, independent conditional: 58, independent unconditional: 28, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 86, independent conditional: 30, independent unconditional: 56, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 86, independent conditional: 30, independent unconditional: 56, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 84, independent conditional: 28, independent unconditional: 56, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 114, Positive cache size: 97, Positive conditional cache size: 10, Positive unconditional cache size: 87, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 28, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 40 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 20 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 72, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 56, independent unconditional: 16, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 72, independent conditional: 49, independent unconditional: 23, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 88, independent: 72, independent conditional: 49, independent unconditional: 23, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 67, independent conditional: 47, independent unconditional: 20, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 119, Positive conditional cache size: 14, Positive unconditional cache size: 105, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 35 PlacesBefore, 35 PlacesAfterwards, 20 TransitionsBefore, 19 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, 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: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 155, Positive conditional cache size: 15, Positive unconditional cache size: 140, Negative cache size: 17, Negative conditional cache size: 3, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 [L802] 3 z = 1 [L805] 3 __unbuffered_p2_EAX = z [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 [L750] 1 x = 1 [L762] 1 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] 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}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 838]: 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: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 9 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=7, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 542 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:25:42,166 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...