/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 22:53:30,389 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 22:53:30,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 22:53:30,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 22:53:30,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 22:53:30,421 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 22:53:30,422 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 22:53:30,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 22:53:30,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 22:53:30,424 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 22:53:30,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 22:53:30,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 22:53:30,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 22:53:30,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 22:53:30,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 22:53:30,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 22:53:30,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 22:53:30,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 22:53:30,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 22:53:30,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 22:53:30,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 22:53:30,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 22:53:30,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 22:53:30,433 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 22:53:30,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 22:53:30,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 22:53:30,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 22:53:30,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 22:53:30,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 22:53:30,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 22:53:30,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 22:53:30,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 22:53:30,438 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 22:53:30,439 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 22:53:30,439 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 22:53:30,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 22:53:30,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 22:53:30,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 22:53:30,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 22:53:30,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 22:53:30,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 22:53:30,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-05 22:53:30,464 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 22:53:30,465 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 22:53:30,467 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 22:53:30,467 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 22:53:30,467 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 22:53:30,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 22:53:30,468 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 22:53:30,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 22:53:30,468 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 22:53:30,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 22:53:30,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 22:53:30,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 22:53:30,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:30,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 22:53:30,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 22:53:30,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 22:53:30,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 22:53:30,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 22:53:30,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 22:53:30,749 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 22:53:30,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-05 22:53:31,610 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 22:53:31,849 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 22:53:31,849 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-05 22:53:31,858 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e59c886/872118f6ca1b4d0bae792d8b11d1dadf/FLAGa336e33ff [2022-12-05 22:53:31,869 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21e59c886/872118f6ca1b4d0bae792d8b11d1dadf [2022-12-05 22:53:31,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 22:53:31,872 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 22:53:31,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:31,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 22:53:31,875 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 22:53:31,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:31" (1/1) ... [2022-12-05 22:53:31,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9c8d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:31, skipping insertion in model container [2022-12-05 22:53:31,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 10:53:31" (1/1) ... [2022-12-05 22:53:31,881 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 22:53:31,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 22:53:32,062 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-12-05 22:53:32,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,224 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,225 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,228 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,232 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:32,265 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 22:53:32,277 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/mix003_power.opt_pso.opt_rmo.opt_tso.opt.i[974,987] [2022-12-05 22:53:32,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 22:53:32,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 22:53:32,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 22:53:32,351 INFO L208 MainTranslator]: Completed translation [2022-12-05 22:53:32,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32 WrapperNode [2022-12-05 22:53:32,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 22:53:32,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:32,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 22:53:32,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 22:53:32,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,422 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2022-12-05 22:53:32,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 22:53:32,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 22:53:32,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 22:53:32,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 22:53:32,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,473 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 22:53:32,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 22:53:32,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 22:53:32,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 22:53:32,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (1/1) ... [2022-12-05 22:53:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 22:53:32,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 22:53: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-05 22:53:32,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-05 22:53:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 22:53:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 22:53:32,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 22:53:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 22:53:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 22:53:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 22:53:32,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 22:53:32,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 22:53: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-05 22:53:32,746 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 22:53:32,747 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 22:53:32,945 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 22:53:33,038 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 22:53:33,038 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 22:53:33,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:33 BoogieIcfgContainer [2022-12-05 22:53:33,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 22:53:33,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 22:53:33,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 22:53:33,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 22:53:33,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 10:53:31" (1/3) ... [2022-12-05 22:53:33,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418306b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:33, skipping insertion in model container [2022-12-05 22:53:33,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 10:53:32" (2/3) ... [2022-12-05 22:53:33,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@418306b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 10:53:33, skipping insertion in model container [2022-12-05 22:53:33,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 10:53:33" (3/3) ... [2022-12-05 22:53:33,045 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003_power.opt_pso.opt_rmo.opt_tso.opt.i [2022-12-05 22:53:33,057 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 22:53:33,057 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 22:53:33,057 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 22:53:33,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 22:53:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 237 flow [2022-12-05 22:53:33,143 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-05 22:53:33,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:33,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 22:53:33,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 111 transitions, 237 flow [2022-12-05 22:53:33,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 108 transitions, 225 flow [2022-12-05 22:53:33,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:33,162 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-05 22:53:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 225 flow [2022-12-05 22:53:33,182 INFO L130 PetriNetUnfolder]: 2/108 cut-off events. [2022-12-05 22:53:33,182 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:33,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-05 22:53:33,203 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 225 flow [2022-12-05 22:53:33,204 INFO L188 LiptonReduction]: Number of co-enabled transitions 1860 [2022-12-05 22:53:36,996 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-05 22:53:37,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 22:53:37,010 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;@68b6fb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 22:53:37,010 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 22:53:37,013 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 22:53:37,013 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:37,013 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:37,014 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:37,014 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-05 22:53:37,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:37,017 INFO L85 PathProgramCache]: Analyzing trace with hash 313211672, now seen corresponding path program 1 times [2022-12-05 22:53:37,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:37,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429099629] [2022-12-05 22:53:37,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:37,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429099629] [2022-12-05 22:53:37,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429099629] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:37,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:37,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724472802] [2022-12-05 22:53:37,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:37,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:37,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:37,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:37,362 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-05 22:53:37,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:37,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:37,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-05 22:53:37,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:37,566 INFO L130 PetriNetUnfolder]: 777/1233 cut-off events. [2022-12-05 22:53:37,566 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 22:53:37,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 1233 events. 777/1233 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5979 event pairs, 201 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 2427. Up to 937 conditions per place. [2022-12-05 22:53:37,573 INFO L137 encePairwiseOnDemand]: 22/27 looper letters, 24 selfloop transitions, 2 changer transitions 4/34 dead transitions. [2022-12-05 22:53:37,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 137 flow [2022-12-05 22:53:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-12-05 22:53:37,581 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5802469135802469 [2022-12-05 22:53:37,582 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 63 flow. Second operand 3 states and 47 transitions. [2022-12-05 22:53:37,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 137 flow [2022-12-05 22:53:37,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 22:53:37,585 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-05 22:53:37,586 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-05 22:53:37,589 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 22:53:37,589 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:37,589 INFO L89 Accepts]: Start accepts. Operand has 33 places, 22 transitions, 54 flow [2022-12-05 22:53:37,591 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:37,592 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:37,592 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 54 flow [2022-12-05 22:53:37,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2022-12-05 22:53:37,596 INFO L130 PetriNetUnfolder]: 0/22 cut-off events. [2022-12-05 22:53:37,596 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:37,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-05 22:53:37,597 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 54 flow [2022-12-05 22:53:37,597 INFO L188 LiptonReduction]: Number of co-enabled transitions 230 [2022-12-05 22:53:37,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:37,706 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-05 22:53:37,706 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 52 flow [2022-12-05 22:53:37,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:37,706 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:37,706 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:37,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 22:53:37,707 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-05 22:53:37,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:37,707 INFO L85 PathProgramCache]: Analyzing trace with hash 348807821, now seen corresponding path program 1 times [2022-12-05 22:53:37,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:37,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827224092] [2022-12-05 22:53:37,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:37,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:37,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827224092] [2022-12-05 22:53:37,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827224092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:37,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:37,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647564583] [2022-12-05 22:53:37,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:37,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:37,883 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:53:37,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 52 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-05 22:53:37,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:37,883 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:53:37,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:38,079 INFO L130 PetriNetUnfolder]: 1069/1590 cut-off events. [2022-12-05 22:53:38,080 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-05 22:53:38,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1590 events. 1069/1590 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6280 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3300. Up to 1515 conditions per place. [2022-12-05 22:53:38,088 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-05 22:53:38,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2022-12-05 22:53:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:38,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:38,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 22:53:38,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-05 22:53:38,090 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 52 flow. Second operand 3 states and 34 transitions. [2022-12-05 22:53:38,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2022-12-05 22:53:38,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:38,092 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,092 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-05 22:53:38,092 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2022-12-05 22:53:38,092 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:38,092 INFO L89 Accepts]: Start accepts. Operand has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,093 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:38,093 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:38,093 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,099 INFO L130 PetriNetUnfolder]: 14/66 cut-off events. [2022-12-05 22:53:38,099 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 22:53:38,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 66 events. 14/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 211 event pairs, 6 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 29 conditions per place. [2022-12-05 22:53:38,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-05 22:53:38,113 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:38,114 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-05 22:53:38,114 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2022-12-05 22:53:38,114 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-05 22:53:38,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:38,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 22:53:38,115 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-05 22:53:38,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1821724760, now seen corresponding path program 1 times [2022-12-05 22:53:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:38,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845130399] [2022-12-05 22:53:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:38,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:38,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:38,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845130399] [2022-12-05 22:53:38,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845130399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:38,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:38,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 22:53:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950969422] [2022-12-05 22:53:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:38,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 22:53:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:38,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 22:53:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 22:53:38,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:38,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:38,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:38,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:38,357 INFO L130 PetriNetUnfolder]: 620/1031 cut-off events. [2022-12-05 22:53:38,357 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-05 22:53:38,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1031 events. 620/1031 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4752 event pairs, 219 based on Foata normal form. 26/1034 useless extension candidates. Maximal degree in co-relation 2176. Up to 631 conditions per place. [2022-12-05 22:53:38,363 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2022-12-05 22:53:38,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 140 flow [2022-12-05 22:53:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:38,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 22:53:38,365 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:53:38,365 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 35 transitions. [2022-12-05 22:53:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 140 flow [2022-12-05 22:53:38,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:38,366 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,366 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-12-05 22:53:38,367 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-05 22:53:38,367 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:38,367 INFO L89 Accepts]: Start accepts. Operand has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,368 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:38,368 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:38,368 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,374 INFO L130 PetriNetUnfolder]: 9/47 cut-off events. [2022-12-05 22:53:38,374 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-05 22:53:38,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 47 events. 9/47 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 2 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 81. Up to 21 conditions per place. [2022-12-05 22:53:38,375 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,375 INFO L188 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-05 22:53:38,378 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:38,378 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-05 22:53:38,378 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2022-12-05 22:53:38,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,379 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:38,379 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 22:53:38,379 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-05 22:53:38,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 194678734, now seen corresponding path program 1 times [2022-12-05 22:53:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687019334] [2022-12-05 22:53:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:38,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:38,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687019334] [2022-12-05 22:53:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687019334] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:38,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:38,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 22:53:38,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359527548] [2022-12-05 22:53:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:38,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:38,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:38,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:38,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:38,507 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 22:53:38,507 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,507 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:38,507 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 22:53:38,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:38,662 INFO L130 PetriNetUnfolder]: 911/1368 cut-off events. [2022-12-05 22:53:38,662 INFO L131 PetriNetUnfolder]: For 448/448 co-relation queries the response was YES. [2022-12-05 22:53:38,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 1368 events. 911/1368 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5378 event pairs, 353 based on Foata normal form. 32/1400 useless extension candidates. Maximal degree in co-relation 3250. Up to 921 conditions per place. [2022-12-05 22:53:38,667 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2022-12-05 22:53:38,667 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 186 flow [2022-12-05 22:53:38,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 22:53:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 22:53:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-05 22:53:38,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2022-12-05 22:53:38,669 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 34 transitions. [2022-12-05 22:53:38,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 186 flow [2022-12-05 22:53:38,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:38,671 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-05 22:53:38,672 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-05 22:53:38,672 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:38,672 INFO L89 Accepts]: Start accepts. Operand has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,672 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:38,672 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:38,672 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,677 INFO L130 PetriNetUnfolder]: 6/42 cut-off events. [2022-12-05 22:53:38,677 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 22:53:38,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 42 events. 6/42 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 108 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 75. Up to 16 conditions per place. [2022-12-05 22:53:38,677 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,678 INFO L188 LiptonReduction]: Number of co-enabled transitions 222 [2022-12-05 22:53:38,678 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 22:53:38,679 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-05 22:53:38,679 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2022-12-05 22:53:38,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,679 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:38,679 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:38,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 22:53:38,680 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-05 22:53:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash 163995440, now seen corresponding path program 1 times [2022-12-05 22:53:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556152542] [2022-12-05 22:53:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:38,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556152542] [2022-12-05 22:53:38,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556152542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:38,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:38,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:38,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176306740] [2022-12-05 22:53:38,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:38,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:38,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:38,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:38,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:38,859 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2022-12-05 22:53:38,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:38,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:38,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2022-12-05 22:53:38,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:38,989 INFO L130 PetriNetUnfolder]: 466/818 cut-off events. [2022-12-05 22:53:38,990 INFO L131 PetriNetUnfolder]: For 162/166 co-relation queries the response was YES. [2022-12-05 22:53:38,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1878 conditions, 818 events. 466/818 cut-off events. For 162/166 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3925 event pairs, 90 based on Foata normal form. 88/891 useless extension candidates. Maximal degree in co-relation 1864. Up to 460 conditions per place. [2022-12-05 22:53:38,993 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 43 selfloop transitions, 7 changer transitions 2/57 dead transitions. [2022-12-05 22:53:38,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 272 flow [2022-12-05 22:53:38,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:38,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-12-05 22:53:38,995 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2022-12-05 22:53:38,995 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 67 transitions. [2022-12-05 22:53:38,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 272 flow [2022-12-05 22:53:38,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 266 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 22:53:38,997 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 134 flow [2022-12-05 22:53:38,997 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-12-05 22:53:38,999 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2022-12-05 22:53:38,999 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:38,999 INFO L89 Accepts]: Start accepts. Operand has 39 places, 30 transitions, 134 flow [2022-12-05 22:53:39,000 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:39,000 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:39,000 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 134 flow [2022-12-05 22:53:39,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 134 flow [2022-12-05 22:53:39,010 INFO L130 PetriNetUnfolder]: 44/131 cut-off events. [2022-12-05 22:53:39,010 INFO L131 PetriNetUnfolder]: For 85/106 co-relation queries the response was YES. [2022-12-05 22:53:39,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 131 events. 44/131 cut-off events. For 85/106 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 582 event pairs, 17 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 347. Up to 72 conditions per place. [2022-12-05 22:53:39,011 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 134 flow [2022-12-05 22:53:39,011 INFO L188 LiptonReduction]: Number of co-enabled transitions 282 [2022-12-05 22:53:39,014 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] L853-3-->L857: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= v_~main$tmp_guard0~0_56 (ite (= (ite (= v_~__unbuffered_cnt~0_107 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_35|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [468] L784-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_13|) (= |v_P1Thread1of1ForFork2_#res.base_13| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_13|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] [2022-12-05 22:53:39,036 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [463] L853-3-->L857: Formula: (and (= (mod v_~main$tmp_guard0~0_56 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|) (= v_~main$tmp_guard0~0_56 (ite (= (ite (= v_~__unbuffered_cnt~0_107 3) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_56, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_35|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [416] L831-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res#1.base_7| 0) (= 0 |v_P2Thread1of1ForFork0_#res#1.offset_7|) (= (+ v_~__unbuffered_cnt~0_60 1) v_~__unbuffered_cnt~0_59)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60} OutVars{P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res#1.offset, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res#1.base] [2022-12-05 22:53:39,083 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:39,084 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-05 22:53:39,084 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 136 flow [2022-12-05 22:53:39,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:39,084 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:39,085 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:39,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 22:53:39,085 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-05 22:53:39,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1646951429, now seen corresponding path program 1 times [2022-12-05 22:53:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478184175] [2022-12-05 22:53:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:39,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478184175] [2022-12-05 22:53:39,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478184175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:39,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:39,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517329892] [2022-12-05 22:53:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:39,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 22:53:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 22:53:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 22:53:39,255 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-05 22:53:39,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:39,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:39,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-05 22:53:39,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:39,381 INFO L130 PetriNetUnfolder]: 267/522 cut-off events. [2022-12-05 22:53:39,381 INFO L131 PetriNetUnfolder]: For 377/378 co-relation queries the response was YES. [2022-12-05 22:53:39,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 522 events. 267/522 cut-off events. For 377/378 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2407 event pairs, 52 based on Foata normal form. 49/562 useless extension candidates. Maximal degree in co-relation 1584. Up to 199 conditions per place. [2022-12-05 22:53:39,383 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 43 selfloop transitions, 12 changer transitions 9/69 dead transitions. [2022-12-05 22:53:39,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 400 flow [2022-12-05 22:53:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2022-12-05 22:53:39,384 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2022-12-05 22:53:39,384 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 136 flow. Second operand 6 states and 83 transitions. [2022-12-05 22:53:39,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 400 flow [2022-12-05 22:53:39,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 392 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 22:53:39,387 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 214 flow [2022-12-05 22:53:39,387 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-12-05 22:53:39,388 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2022-12-05 22:53:39,388 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:39,388 INFO L89 Accepts]: Start accepts. Operand has 45 places, 35 transitions, 214 flow [2022-12-05 22:53:39,388 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:39,388 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:39,389 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 214 flow [2022-12-05 22:53:39,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 214 flow [2022-12-05 22:53:39,396 INFO L130 PetriNetUnfolder]: 23/100 cut-off events. [2022-12-05 22:53:39,397 INFO L131 PetriNetUnfolder]: For 232/247 co-relation queries the response was YES. [2022-12-05 22:53:39,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 100 events. 23/100 cut-off events. For 232/247 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 418 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 355. Up to 59 conditions per place. [2022-12-05 22:53:39,398 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 214 flow [2022-12-05 22:53:39,398 INFO L188 LiptonReduction]: Number of co-enabled transitions 298 [2022-12-05 22:53:39,447 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:39,448 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 60 [2022-12-05 22:53:39,448 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 206 flow [2022-12-05 22:53:39,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:39,448 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:39,448 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:39,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 22:53:39,448 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-05 22:53:39,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2074429776, now seen corresponding path program 1 times [2022-12-05 22:53:39,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:39,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685424568] [2022-12-05 22:53:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:39,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685424568] [2022-12-05 22:53:39,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685424568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:39,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:39,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 22:53:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570631366] [2022-12-05 22:53:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:39,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:39,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:39,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:39,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:39,600 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 23 [2022-12-05 22:53:39,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:39,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:39,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 23 [2022-12-05 22:53:39,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:39,735 INFO L130 PetriNetUnfolder]: 178/360 cut-off events. [2022-12-05 22:53:39,735 INFO L131 PetriNetUnfolder]: For 660/660 co-relation queries the response was YES. [2022-12-05 22:53:39,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 360 events. 178/360 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1535 event pairs, 49 based on Foata normal form. 12/364 useless extension candidates. Maximal degree in co-relation 1165. Up to 123 conditions per place. [2022-12-05 22:53:39,737 INFO L137 encePairwiseOnDemand]: 15/23 looper letters, 40 selfloop transitions, 15 changer transitions 8/68 dead transitions. [2022-12-05 22:53:39,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 68 transitions, 442 flow [2022-12-05 22:53:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 22:53:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 22:53:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2022-12-05 22:53:39,738 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2022-12-05 22:53:39,738 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 206 flow. Second operand 8 states and 88 transitions. [2022-12-05 22:53:39,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 68 transitions, 442 flow [2022-12-05 22:53:39,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 396 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-05 22:53:39,742 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 216 flow [2022-12-05 22:53:39,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2022-12-05 22:53:39,742 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-05 22:53:39,742 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:39,743 INFO L89 Accepts]: Start accepts. Operand has 51 places, 35 transitions, 216 flow [2022-12-05 22:53:39,743 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:39,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:39,743 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 35 transitions, 216 flow [2022-12-05 22:53:39,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 35 transitions, 216 flow [2022-12-05 22:53:39,750 INFO L130 PetriNetUnfolder]: 14/68 cut-off events. [2022-12-05 22:53:39,750 INFO L131 PetriNetUnfolder]: For 144/145 co-relation queries the response was YES. [2022-12-05 22:53:39,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 68 events. 14/68 cut-off events. For 144/145 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 214 event pairs, 1 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 219. Up to 23 conditions per place. [2022-12-05 22:53:39,750 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 216 flow [2022-12-05 22:53:39,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 234 [2022-12-05 22:53:40,038 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-05 22:53:40,039 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-05 22:53:40,039 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 178 flow [2022-12-05 22:53:40,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:40,039 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:40,039 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:40,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 22:53:40,040 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-05 22:53:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:40,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1455678962, now seen corresponding path program 1 times [2022-12-05 22:53:40,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:40,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508388327] [2022-12-05 22:53:40,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:40,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:40,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:40,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508388327] [2022-12-05 22:53:40,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508388327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:40,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:40,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:40,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460371128] [2022-12-05 22:53:40,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:40,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:40,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:40,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:40,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:40,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-05 22:53:40,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 178 flow. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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-05 22:53:40,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:40,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-05 22:53:40,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:40,268 INFO L130 PetriNetUnfolder]: 286/501 cut-off events. [2022-12-05 22:53:40,268 INFO L131 PetriNetUnfolder]: For 629/629 co-relation queries the response was YES. [2022-12-05 22:53:40,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 501 events. 286/501 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1936 event pairs, 34 based on Foata normal form. 1/502 useless extension candidates. Maximal degree in co-relation 1585. Up to 330 conditions per place. [2022-12-05 22:53:40,271 INFO L137 encePairwiseOnDemand]: 11/19 looper letters, 54 selfloop transitions, 12 changer transitions 3/69 dead transitions. [2022-12-05 22:53:40,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 493 flow [2022-12-05 22:53:40,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 22:53:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 22:53:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-12-05 22:53:40,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5684210526315789 [2022-12-05 22:53:40,272 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 178 flow. Second operand 5 states and 54 transitions. [2022-12-05 22:53:40,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 493 flow [2022-12-05 22:53:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 69 transitions, 402 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-12-05 22:53:40,275 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,275 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2022-12-05 22:53:40,276 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-05 22:53:40,276 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:40,276 INFO L89 Accepts]: Start accepts. Operand has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,276 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:40,277 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:40,277 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,285 INFO L130 PetriNetUnfolder]: 35/112 cut-off events. [2022-12-05 22:53:40,285 INFO L131 PetriNetUnfolder]: For 97/104 co-relation queries the response was YES. [2022-12-05 22:53:40,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 112 events. 35/112 cut-off events. For 97/104 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 439 event pairs, 4 based on Foata normal form. 5/111 useless extension candidates. Maximal degree in co-relation 297. Up to 28 conditions per place. [2022-12-05 22:53:40,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 228 [2022-12-05 22:53:40,416 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:40,417 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 141 [2022-12-05 22:53:40,417 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 186 flow [2022-12-05 22:53:40,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-05 22:53:40,417 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:40,417 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:40,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 22:53:40,417 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-05 22:53:40,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:40,417 INFO L85 PathProgramCache]: Analyzing trace with hash 749627074, now seen corresponding path program 2 times [2022-12-05 22:53:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093228278] [2022-12-05 22:53:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:40,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:40,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:40,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093228278] [2022-12-05 22:53:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093228278] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:40,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:40,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182105416] [2022-12-05 22:53:40,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:40,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:40,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:40,550 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 20 [2022-12-05 22:53:40,550 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:40,550 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:40,550 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 20 [2022-12-05 22:53:40,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:40,638 INFO L130 PetriNetUnfolder]: 238/475 cut-off events. [2022-12-05 22:53:40,638 INFO L131 PetriNetUnfolder]: For 559/573 co-relation queries the response was YES. [2022-12-05 22:53:40,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 475 events. 238/475 cut-off events. For 559/573 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2171 event pairs, 49 based on Foata normal form. 5/469 useless extension candidates. Maximal degree in co-relation 1526. Up to 210 conditions per place. [2022-12-05 22:53:40,640 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 30 selfloop transitions, 1 changer transitions 26/60 dead transitions. [2022-12-05 22:53:40,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 60 transitions, 398 flow [2022-12-05 22:53:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-12-05 22:53:40,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-05 22:53:40,641 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 186 flow. Second operand 4 states and 45 transitions. [2022-12-05 22:53:40,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 60 transitions, 398 flow [2022-12-05 22:53:40,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 60 transitions, 396 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 22:53:40,644 INFO L231 Difference]: Finished difference. Result has 44 places, 27 transitions, 133 flow [2022-12-05 22:53:40,644 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=44, PETRI_TRANSITIONS=27} [2022-12-05 22:53:40,645 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2022-12-05 22:53:40,645 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:40,645 INFO L89 Accepts]: Start accepts. Operand has 44 places, 27 transitions, 133 flow [2022-12-05 22:53:40,645 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:40,645 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:40,646 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 27 transitions, 133 flow [2022-12-05 22:53:40,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 133 flow [2022-12-05 22:53:40,651 INFO L130 PetriNetUnfolder]: 15/62 cut-off events. [2022-12-05 22:53:40,651 INFO L131 PetriNetUnfolder]: For 79/83 co-relation queries the response was YES. [2022-12-05 22:53:40,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 62 events. 15/62 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 188 event pairs, 3 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 162. Up to 16 conditions per place. [2022-12-05 22:53:40,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 133 flow [2022-12-05 22:53:40,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 142 [2022-12-05 22:53:40,677 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 22:53:40,678 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 33 [2022-12-05 22:53:40,678 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 131 flow [2022-12-05 22:53:40,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:40,678 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:40,678 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:40,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 22:53:40,678 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-05 22:53:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash -555095815, now seen corresponding path program 1 times [2022-12-05 22:53:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:40,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376992015] [2022-12-05 22:53:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:40,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-05 22:53:40,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:40,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376992015] [2022-12-05 22:53:40,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376992015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:40,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:40,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 22:53:40,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206513597] [2022-12-05 22:53:40,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:40,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 22:53:40,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:40,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 22:53:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 22:53:40,811 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 18 [2022-12-05 22:53:40,811 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:40,811 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:40,811 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 18 [2022-12-05 22:53:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:40,894 INFO L130 PetriNetUnfolder]: 140/279 cut-off events. [2022-12-05 22:53:40,894 INFO L131 PetriNetUnfolder]: For 631/631 co-relation queries the response was YES. [2022-12-05 22:53:40,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 279 events. 140/279 cut-off events. For 631/631 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1103 event pairs, 8 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 1001. Up to 136 conditions per place. [2022-12-05 22:53:40,895 INFO L137 encePairwiseOnDemand]: 15/18 looper letters, 27 selfloop transitions, 1 changer transitions 23/52 dead transitions. [2022-12-05 22:53:40,895 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 356 flow [2022-12-05 22:53:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 22:53:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 22:53:40,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-12-05 22:53:40,896 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 22:53:40,896 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 131 flow. Second operand 4 states and 40 transitions. [2022-12-05 22:53:40,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 356 flow [2022-12-05 22:53:40,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 348 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 22:53:40,898 INFO L231 Difference]: Finished difference. Result has 43 places, 24 transitions, 123 flow [2022-12-05 22:53:40,898 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=43, PETRI_TRANSITIONS=24} [2022-12-05 22:53:40,899 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-05 22:53:40,899 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:40,899 INFO L89 Accepts]: Start accepts. Operand has 43 places, 24 transitions, 123 flow [2022-12-05 22:53:40,899 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:40,899 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:40,900 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 24 transitions, 123 flow [2022-12-05 22:53:40,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 123 flow [2022-12-05 22:53:40,904 INFO L130 PetriNetUnfolder]: 7/41 cut-off events. [2022-12-05 22:53:40,904 INFO L131 PetriNetUnfolder]: For 72/78 co-relation queries the response was YES. [2022-12-05 22:53:40,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 41 events. 7/41 cut-off events. For 72/78 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 101 event pairs, 0 based on Foata normal form. 4/44 useless extension candidates. Maximal degree in co-relation 108. Up to 12 conditions per place. [2022-12-05 22:53:40,904 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 123 flow [2022-12-05 22:53:40,904 INFO L188 LiptonReduction]: Number of co-enabled transitions 58 [2022-12-05 22:53:41,860 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 22:53:41,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 962 [2022-12-05 22:53:41,861 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 20 transitions, 113 flow [2022-12-05 22:53:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 22:53:41,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:41,861 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:41,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 22:53:41,861 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-05 22:53:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -874548921, now seen corresponding path program 1 times [2022-12-05 22:53:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:41,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611038364] [2022-12-05 22:53:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 22:53:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 22:53:42,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 22:53:42,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611038364] [2022-12-05 22:53:42,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611038364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 22:53:42,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 22:53:42,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 22:53:42,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084406354] [2022-12-05 22:53:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 22:53:42,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 22:53:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 22:53:42,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 22:53:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-05 22:53:42,570 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-05 22:53:42,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 20 transitions, 113 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-05 22:53:42,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 22:53:42,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-05 22:53:42,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 22:53:42,743 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2022-12-05 22:53:42,743 INFO L131 PetriNetUnfolder]: For 192/192 co-relation queries the response was YES. [2022-12-05 22:53:42,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 72 events. 26/72 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 231 event pairs, 1 based on Foata normal form. 1/73 useless extension candidates. Maximal degree in co-relation 275. Up to 32 conditions per place. [2022-12-05 22:53:42,744 INFO L137 encePairwiseOnDemand]: 9/14 looper letters, 20 selfloop transitions, 4 changer transitions 11/35 dead transitions. [2022-12-05 22:53:42,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 276 flow [2022-12-05 22:53:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 22:53:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 22:53:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-12-05 22:53:42,745 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2619047619047619 [2022-12-05 22:53:42,745 INFO L175 Difference]: Start difference. First operand has 38 places, 20 transitions, 113 flow. Second operand 6 states and 22 transitions. [2022-12-05 22:53:42,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 276 flow [2022-12-05 22:53:42,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 258 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-05 22:53:42,746 INFO L231 Difference]: Finished difference. Result has 40 places, 20 transitions, 113 flow [2022-12-05 22:53:42,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=34, 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=113, PETRI_PLACES=40, PETRI_TRANSITIONS=20} [2022-12-05 22:53:42,747 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2022-12-05 22:53:42,747 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 22:53:42,747 INFO L89 Accepts]: Start accepts. Operand has 40 places, 20 transitions, 113 flow [2022-12-05 22:53:42,747 INFO L95 Accepts]: Finished accepts. [2022-12-05 22:53:42,747 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 22:53:42,748 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 20 transitions, 113 flow [2022-12-05 22:53:42,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 20 transitions, 113 flow [2022-12-05 22:53:42,751 INFO L130 PetriNetUnfolder]: 7/33 cut-off events. [2022-12-05 22:53:42,751 INFO L131 PetriNetUnfolder]: For 36/37 co-relation queries the response was YES. [2022-12-05 22:53:42,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 33 events. 7/33 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 71 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 92. Up to 12 conditions per place. [2022-12-05 22:53:42,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 20 transitions, 113 flow [2022-12-05 22:53:42,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 14 [2022-12-05 22:53:43,230 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [483] L824-->P2EXIT: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_236 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_454 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_277 256) 0)))) (let ((.cse0 (and (not (= (mod v_~y$w_buff0_used~0_455 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_427 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_322 (ite .cse1 v_~y$w_buff1~0_287 v_~y~0_369)) v_~y~0_368) (= v_~__unbuffered_cnt~0_183 (+ v_~__unbuffered_cnt~0_184 1)) (= (ite .cse0 0 v_~y$w_buff0_used~0_455) v_~y$w_buff0_used~0_454) (= |v_P2Thread1of1ForFork0_#res#1.offset_23| 0) (= v_~y$r_buff0_thd3~0_276 (ite .cse2 0 v_~y$r_buff0_thd3~0_277)) (= |v_P2Thread1of1ForFork0_#res#1.base_23| 0) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_426 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd3~0_276 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_236) v_~y$r_buff1_thd3~0_235) (= v_~y$w_buff1_used~0_426 (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_427))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_236, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_455, ~y$w_buff1~0=v_~y$w_buff1~0_287, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_277, ~y$w_buff0~0=v_~y$w_buff0~0_322, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_184, ~y~0=v_~y~0_369, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_427} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_235, P2Thread1of1ForFork0_#res#1.offset=|v_P2Thread1of1ForFork0_#res#1.offset_23|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_454, ~y$w_buff1~0=v_~y$w_buff1~0_287, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_276, ~y$w_buff0~0=v_~y$w_buff0~0_322, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_183, ~y~0=v_~y~0_368, P2Thread1of1ForFork0_#res#1.base=|v_P2Thread1of1ForFork0_#res#1.base_23|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_426} 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 [476] L853-3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_404 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd0~0_152 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_147 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_405 256) 0)) .cse5)) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_379 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49| 0) (= v_~y$r_buff0_thd0~0_146 (ite .cse0 0 v_~y$r_buff0_thd0~0_147)) (= v_~main$tmp_guard1~0_80 (ite (= (ite (not (and (= v_~__unbuffered_p1_EBX~0_98 0) (= v_~__unbuffered_p1_EAX~0_64 1) (= v_~__unbuffered_p2_EAX~0_92 1) (= v_~__unbuffered_p0_EAX~0_67 0) (= v_~__unbuffered_p2_EBX~0_76 0))) 1 0) 0) 0 1)) (= v_~y~0_320 (ite .cse1 v_~y$w_buff0~0_280 (ite .cse2 v_~y$w_buff1~0_247 v_~y~0_321))) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| (mod v_~main$tmp_guard1~0_80 256)) (= (ite .cse1 0 v_~y$w_buff0_used~0_405) v_~y$w_buff0_used~0_404) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|) (= v_~y$w_buff1_used~0_378 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_379)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| 0)) (= (ite (= (ite (= v_~__unbuffered_cnt~0_181 3) 1 0) 0) 0 1) v_~main$tmp_guard0~0_94) (= v_~y$r_buff1_thd0~0_151 (ite (or (and (not (= (mod v_~y$w_buff1_used~0_378 256) 0)) .cse3) (and (not (= (mod v_~y$r_buff0_thd0~0_146 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_152)) (= (mod v_~main$tmp_guard0~0_94 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|) (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_85| |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|)))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_76, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_405, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_64, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_147, ~y$w_buff0~0=v_~y$w_buff0~0_280, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_321, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_152, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_379} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_49|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_76, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_404, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_80, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_94, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_75|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_67, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_64, ~y$w_buff1~0=v_~y$w_buff1~0_247, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_146, ~y$w_buff0~0=v_~y$w_buff0~0_280, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_85|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, ~y~0=v_~y~0_320, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_151, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_378, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_97|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~pre11#1, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet12#1, 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-05 22:53:43,557 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 22:53:43,558 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 811 [2022-12-05 22:53:43,558 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 123 flow [2022-12-05 22:53:43,558 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-05 22:53:43,558 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 22:53:43,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:43,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 22:53:43,558 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 22:53:43,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 22:53:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -54066599, now seen corresponding path program 1 times [2022-12-05 22:53:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 22:53:43,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268734298] [2022-12-05 22:53:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 22:53:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 22:53:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:43,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 22:53:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 22:53:43,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 22:53:43,637 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 22:53:43,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 22:53:43,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 22:53:43,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 22:53:43,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 22:53:43,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 22:53:43,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 22:53:43,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 22:53:43,639 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 22:53:43,662 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 22:53:43,663 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 22:53:43,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 10:53:43 BasicIcfg [2022-12-05 22:53:43,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 22:53:43,718 INFO L158 Benchmark]: Toolchain (without parser) took 11845.33ms. Allocated memory was 181.4MB in the beginning and 377.5MB in the end (delta: 196.1MB). Free memory was 154.5MB in the beginning and 339.3MB in the end (delta: -184.8MB). Peak memory consumption was 226.2MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,718 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 22:53:43,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.57ms. Allocated memory is still 181.4MB. Free memory was 154.2MB in the beginning and 126.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.46ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,719 INFO L158 Benchmark]: Boogie Preprocessor took 53.54ms. Allocated memory is still 181.4MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,719 INFO L158 Benchmark]: RCFGBuilder took 561.46ms. Allocated memory is still 181.4MB. Free memory was 122.0MB in the beginning and 122.1MB in the end (delta: -130.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,719 INFO L158 Benchmark]: TraceAbstraction took 10676.14ms. Allocated memory was 181.4MB in the beginning and 377.5MB in the end (delta: 196.1MB). Free memory was 121.6MB in the beginning and 339.3MB in the end (delta: -217.7MB). Peak memory consumption was 194.0MB. Max. memory is 8.0GB. [2022-12-05 22:53:43,720 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.09ms. Allocated memory is still 127.9MB. Free memory was 109.4MB in the beginning and 109.4MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 478.57ms. Allocated memory is still 181.4MB. Free memory was 154.2MB in the beginning and 126.8MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.46ms. Allocated memory is still 181.4MB. Free memory was 126.8MB in the beginning and 124.1MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.54ms. Allocated memory is still 181.4MB. Free memory was 124.1MB in the beginning and 122.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 561.46ms. Allocated memory is still 181.4MB. Free memory was 122.0MB in the beginning and 122.1MB in the end (delta: -130.2kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * TraceAbstraction took 10676.14ms. Allocated memory was 181.4MB in the beginning and 377.5MB in the end (delta: 196.1MB). Free memory was 121.6MB in the beginning and 339.3MB in the end (delta: -217.7MB). Peak memory consumption was 194.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 116 PlacesBefore, 36 PlacesAfterwards, 108 TransitionsBefore, 27 TransitionsAfterwards, 1860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 41 ConcurrentYvCompositions, 1 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1496, independent: 1444, independent conditional: 1444, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1496, independent: 1444, independent conditional: 0, independent unconditional: 1444, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1496, independent: 1444, independent conditional: 0, independent unconditional: 1444, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1496, independent: 1444, independent conditional: 0, independent unconditional: 1444, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1113, independent: 1083, independent conditional: 0, independent unconditional: 1083, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1113, independent: 1062, independent conditional: 0, independent unconditional: 1062, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1496, independent: 361, independent conditional: 0, independent unconditional: 361, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1113, unknown conditional: 0, unknown unconditional: 1113] , Statistics on independence cache: Total cache size (in pairs): 1710, Positive cache size: 1680, Positive conditional cache size: 0, Positive unconditional cache size: 1680, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277, independent: 232, independent conditional: 232, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 277, independent: 232, independent conditional: 24, independent unconditional: 208, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 277, independent: 232, independent conditional: 24, independent unconditional: 208, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 277, independent: 232, independent conditional: 24, independent unconditional: 208, dependent: 45, dependent conditional: 6, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 142, independent: 118, independent conditional: 11, independent unconditional: 107, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 142, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 73, dependent conditional: 12, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, independent: 114, independent conditional: 13, independent unconditional: 101, dependent: 21, dependent conditional: 4, dependent unconditional: 17, unknown: 142, unknown conditional: 13, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 124, Positive conditional cache size: 12, Positive unconditional cache size: 112, Negative cache size: 24, Negative conditional cache size: 2, Negative unconditional cache size: 22, 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, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 97, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 97, independent: 80, independent conditional: 9, independent unconditional: 71, dependent: 17, dependent conditional: 2, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 97, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 97, independent: 80, independent conditional: 0, independent unconditional: 80, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 97, independent: 69, independent conditional: 0, independent unconditional: 69, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 135, Positive conditional cache size: 12, Positive unconditional cache size: 123, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 77, independent conditional: 77, 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: 95, independent: 77, independent conditional: 11, independent unconditional: 66, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 77, independent conditional: 0, independent unconditional: 77, 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: 95, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 77, independent conditional: 0, independent unconditional: 77, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 135, Positive conditional cache size: 12, Positive unconditional cache size: 123, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 222 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 70, independent conditional: 70, 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: 88, independent: 70, independent conditional: 11, independent unconditional: 59, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 88, independent: 70, independent conditional: 0, independent unconditional: 70, 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: 88, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 135, Positive conditional cache size: 12, Positive unconditional cache size: 123, Negative cache size: 27, Negative conditional cache size: 2, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 39 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 282 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 238, independent: 204, independent conditional: 204, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 238, independent: 204, independent conditional: 66, independent unconditional: 138, dependent: 34, dependent conditional: 4, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 238, independent: 204, independent conditional: 44, independent unconditional: 160, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 238, independent: 204, independent conditional: 44, independent unconditional: 160, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 238, independent: 194, independent conditional: 41, independent unconditional: 153, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 12, unknown conditional: 3, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 153, Positive conditional cache size: 16, Positive unconditional cache size: 137, Negative cache size: 29, Negative conditional cache size: 2, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 34 TransitionsAfterwards, 298 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 42, dependent conditional: 42, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 111, independent: 69, independent conditional: 21, independent unconditional: 48, dependent: 42, dependent conditional: 4, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, independent: 69, independent conditional: 13, independent unconditional: 56, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, independent: 69, independent conditional: 13, independent unconditional: 56, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, independent: 67, independent conditional: 11, independent unconditional: 56, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 186, Positive cache size: 155, Positive conditional cache size: 18, Positive unconditional cache size: 137, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, 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.3s, 50 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 30 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 219, independent conditional: 219, independent unconditional: 0, dependent: 35, dependent conditional: 35, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 254, independent: 219, independent conditional: 110, independent unconditional: 109, dependent: 35, dependent conditional: 4, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 254, independent: 219, independent conditional: 94, independent unconditional: 125, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 254, independent: 219, independent conditional: 94, independent unconditional: 125, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 254, independent: 209, independent conditional: 84, independent unconditional: 125, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 172, Positive conditional cache size: 28, Positive unconditional cache size: 144, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 40 PlacesBefore, 40 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 228 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 181, independent unconditional: 0, dependent: 25, dependent conditional: 25, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 206, independent: 181, independent conditional: 117, independent unconditional: 64, dependent: 25, dependent conditional: 19, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 214, independent: 181, independent conditional: 63, independent unconditional: 118, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 214, independent: 181, independent conditional: 63, independent unconditional: 118, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 214, independent: 177, independent conditional: 59, independent unconditional: 118, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 181, Positive conditional cache size: 32, Positive unconditional cache size: 149, Negative cache size: 31, Negative conditional cache size: 2, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 81, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 122, independent: 104, independent conditional: 104, 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: 122, independent: 104, independent conditional: 64, independent unconditional: 40, 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: 122, independent: 104, independent conditional: 56, independent unconditional: 48, 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: 122, independent: 104, independent conditional: 56, independent unconditional: 48, 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: 8, independent: 6, independent conditional: 1, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 122, independent: 98, independent conditional: 55, independent unconditional: 43, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 8, unknown conditional: 1, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 242, Positive cache size: 209, Positive conditional cache size: 36, Positive unconditional cache size: 173, Negative cache size: 33, Negative conditional cache size: 2, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 42 PlacesBefore, 38 PlacesAfterwards, 24 TransitionsBefore, 20 TransitionsAfterwards, 58 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, independent: 73, independent conditional: 73, 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: 87, independent: 73, independent conditional: 54, independent unconditional: 19, 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: 87, independent: 73, independent conditional: 53, independent unconditional: 20, 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: 87, independent: 73, independent conditional: 53, independent unconditional: 20, 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: 8, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, independent: 68, independent conditional: 49, independent unconditional: 19, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 282, Positive cache size: 246, Positive conditional cache size: 40, Positive unconditional cache size: 206, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 39 PlacesBefore, 38 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 14 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 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: 16, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 322, Positive cache size: 286, Positive conditional cache size: 40, Positive unconditional cache size: 246, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L726] 0 _Bool y$flush_delayed; [L727] 0 int y$mem_tmp; [L728] 0 _Bool y$r_buff0_thd0; [L729] 0 _Bool y$r_buff0_thd1; [L730] 0 _Bool y$r_buff0_thd2; [L731] 0 _Bool y$r_buff0_thd3; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$read_delayed; [L737] 0 int *y$read_delayed_var; [L738] 0 int y$w_buff0; [L739] 0 _Bool y$w_buff0_used; [L740] 0 int y$w_buff1; [L741] 0 _Bool y$w_buff1_used; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L848] 0 pthread_t t65; [L849] FCALL, FORK 0 pthread_create(&t65, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t65, ((void *)0), P0, ((void *)0))=-2, t65={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] [L850] 0 pthread_t t66; [L851] FCALL, FORK 0 pthread_create(&t66, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t66, ((void *)0), P1, ((void *)0))=-1, t65={5:0}, t66={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] [L852] 0 pthread_t t67; [L853] FCALL, FORK 0 pthread_create(&t67, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t67, ((void *)0), P2, ((void *)0))=0, t65={5:0}, t66={6:0}, t67={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] [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = (_Bool)1 [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 y$flush_delayed = weak$$choice2 [L810] 3 y$mem_tmp = y [L811] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EAX = y [L819] 3 y = y$flush_delayed ? y$mem_tmp : y [L820] 3 y$flush_delayed = (_Bool)0 [L823] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0] [L749] 1 z = 1 [L752] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = x [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 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) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] 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)) [L781] 2 __unbuffered_p1_EBX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, 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] [L826] 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) [L827] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L830] 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 [L833] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 3 return 0; [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L759] 1 return 0; [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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 [L866] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, 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: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 138 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: 10.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 196 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 704 IncrementalHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 11 mSDtfsCounter, 704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=216occurred in iteration=7, InterpolantAutomatonStates: 50, 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, 2.0s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-05 22:53:43,752 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...