/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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:27:37,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:27:37,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:27:37,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:27:37,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:27:37,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:27:37,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:27:37,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:27:37,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:27:37,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:27:37,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:27:37,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:27:37,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:27:37,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:27:37,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:27:37,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:27:37,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:27:37,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:27:37,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:27:37,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:27:37,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:27:37,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:27:37,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:27:37,261 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:27:37,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:27:37,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:27:37,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:27:37,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:27:37,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:27:37,268 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:27:37,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:27:37,269 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:27:37,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:27:37,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:27:37,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:27:37,271 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:27:37,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:27:37,272 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:27:37,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:27:37,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:27:37,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:27:37,274 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-SemanticLbe.epf [2022-12-05 20:27:37,292 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:27:37,292 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:27:37,293 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:27:37,293 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:27:37,294 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:27:37,294 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:27:37,294 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:27:37,295 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:27:37,295 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:27:37,295 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:27:37,295 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:27:37,295 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:27:37,295 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:27:37,296 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:27:37,296 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:27:37,296 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:27:37,296 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:27:37,296 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:27:37,297 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:27:37,297 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:27:37,297 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:27:37,297 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:27:37,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:27:37,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:27:37,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:27:37,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:27:37,310 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:27:37,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:27:37,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:27:37,310 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:27:37,310 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 20:27:37,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:27:37,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:27:37,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:27:37,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:27:37,612 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:27:37,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:27:38,658 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:27:38,946 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:27:38,947 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:27:38,965 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7251f1087/85dd798efba443a29005724f2eca0f04/FLAG4f9a8e254 [2022-12-05 20:27:38,987 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7251f1087/85dd798efba443a29005724f2eca0f04 [2022-12-05 20:27:38,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:27:38,990 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:27:38,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:27:38,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:27:38,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:27:38,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:27:38" (1/1) ... [2022-12-05 20:27:38,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e7aec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:38, skipping insertion in model container [2022-12-05 20:27:38,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:27:38" (1/1) ... [2022-12-05 20:27:39,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:27:39,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:27:39,221 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 20:27:39,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,440 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,441 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,450 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,451 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:27:39,472 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:27:39,486 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/safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2022-12-05 20:27:39,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:27:39,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:27:39,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:27:39,584 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:27:39,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39 WrapperNode [2022-12-05 20:27:39,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:27:39,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:27:39,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:27:39,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:27:39,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,628 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-05 20:27:39,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:27:39,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:27:39,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:27:39,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:27:39,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,640 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,651 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:27:39,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:27:39,662 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:27:39,662 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:27:39,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (1/1) ... [2022-12-05 20:27:39,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:27:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:27:39,696 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 20:27:39,713 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 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:27:39,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:27:39,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:27:39,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:27:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:27:39,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:27:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:27:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:27:39,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:27:39,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:27:39,750 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 20:27:39,950 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:27:39,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:27:40,271 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:27:40,421 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:27:40,421 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:27:40,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:27:40 BoogieIcfgContainer [2022-12-05 20:27:40,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:27:40,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:27:40,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:27:40,430 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:27:40,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:27:38" (1/3) ... [2022-12-05 20:27:40,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66870377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:27:40, skipping insertion in model container [2022-12-05 20:27:40,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:27:39" (2/3) ... [2022-12-05 20:27:40,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66870377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:27:40, skipping insertion in model container [2022-12-05 20:27:40,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:27:40" (3/3) ... [2022-12-05 20:27:40,433 INFO L112 eAbstractionObserver]: Analyzing ICFG safe023_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-05 20:27:40,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:27:40,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:27:40,476 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:27:40,567 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:27:40,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 233 flow [2022-12-05 20:27:40,658 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-05 20:27:40,658 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:40,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 20:27:40,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 109 transitions, 233 flow [2022-12-05 20:27:40,670 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 106 transitions, 221 flow [2022-12-05 20:27:40,671 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:27:40,696 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-05 20:27:40,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 221 flow [2022-12-05 20:27:40,743 INFO L130 PetriNetUnfolder]: 2/106 cut-off events. [2022-12-05 20:27:40,744 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:40,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 106 events. 2/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-05 20:27:40,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 106 transitions, 221 flow [2022-12-05 20:27:40,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 2022 [2022-12-05 20:27:45,882 INFO L203 LiptonReduction]: Total number of compositions: 82 [2022-12-05 20:27:45,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:27:45,900 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=PETRI_NET, 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;@1a1b1c3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:27:45,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:27:45,903 INFO L130 PetriNetUnfolder]: 0/8 cut-off events. [2022-12-05 20:27:45,903 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:27:45,903 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:45,903 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:27:45,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash 518126068, now seen corresponding path program 1 times [2022-12-05 20:27:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:45,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483303037] [2022-12-05 20:27:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:46,224 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 20:27:46,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:46,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483303037] [2022-12-05 20:27:46,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483303037] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:46,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:46,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:46,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9585204] [2022-12-05 20:27:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:46,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:46,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:46,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:46,276 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:46,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 20:27:46,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:46,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:46,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:46,808 INFO L130 PetriNetUnfolder]: 1721/2724 cut-off events. [2022-12-05 20:27:46,808 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-05 20:27:46,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5317 conditions, 2724 events. 1721/2724 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14425 event pairs, 290 based on Foata normal form. 0/2460 useless extension candidates. Maximal degree in co-relation 5306. Up to 2026 conditions per place. [2022-12-05 20:27:46,823 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 33 selfloop transitions, 2 changer transitions 6/42 dead transitions. [2022-12-05 20:27:46,823 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 42 transitions, 178 flow [2022-12-05 20:27:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-05 20:27:46,833 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2022-12-05 20:27:46,834 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 65 flow. Second operand 3 states and 49 transitions. [2022-12-05 20:27:46,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 42 transitions, 178 flow [2022-12-05 20:27:46,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:46,838 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2022-12-05 20:27:46,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-05 20:27:46,843 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -3 predicate places. [2022-12-05 20:27:46,843 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2022-12-05 20:27:46,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 20:27:46,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:46,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:46,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:27:46,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1983591360, now seen corresponding path program 1 times [2022-12-05 20:27:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:46,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563367864] [2022-12-05 20:27:46,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:47,149 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 20:27:47,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563367864] [2022-12-05 20:27:47,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563367864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:47,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:47,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:47,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088471643] [2022-12-05 20:27:47,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:47,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:47,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:47,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:47,154 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:47,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:47,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:47,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:47,402 INFO L130 PetriNetUnfolder]: 958/1442 cut-off events. [2022-12-05 20:27:47,403 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-05 20:27:47,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1442 events. 958/1442 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6374 event pairs, 418 based on Foata normal form. 60/1499 useless extension candidates. Maximal degree in co-relation 3054. Up to 851 conditions per place. [2022-12-05 20:27:47,410 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2022-12-05 20:27:47,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 35 transitions, 154 flow [2022-12-05 20:27:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:47,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:47,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-12-05 20:27:47,412 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4523809523809524 [2022-12-05 20:27:47,412 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 3 states and 38 transitions. [2022-12-05 20:27:47,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 35 transitions, 154 flow [2022-12-05 20:27:47,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:47,415 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-05 20:27:47,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-05 20:27:47,416 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2022-12-05 20:27:47,416 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-05 20:27:47,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:47,416 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:47,416 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:47,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:27:47,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:47,419 INFO L85 PathProgramCache]: Analyzing trace with hash -543635519, now seen corresponding path program 1 times [2022-12-05 20:27:47,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:47,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995042458] [2022-12-05 20:27:47,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:47,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:47,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:47,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995042458] [2022-12-05 20:27:47,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995042458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:47,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:47,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:27:47,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495637473] [2022-12-05 20:27:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:47,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:47,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:47,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:47,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:47,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:47,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:47,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:47,894 INFO L130 PetriNetUnfolder]: 929/1401 cut-off events. [2022-12-05 20:27:47,895 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2022-12-05 20:27:47,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 1401 events. 929/1401 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5861 event pairs, 213 based on Foata normal form. 12/1409 useless extension candidates. Maximal degree in co-relation 3043. Up to 1089 conditions per place. [2022-12-05 20:27:47,902 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 29 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2022-12-05 20:27:47,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 143 flow [2022-12-05 20:27:47,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 20:27:47,905 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-05 20:27:47,905 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 3 states and 35 transitions. [2022-12-05 20:27:47,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 143 flow [2022-12-05 20:27:47,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:47,906 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 62 flow [2022-12-05 20:27:47,907 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-05 20:27:47,908 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, -4 predicate places. [2022-12-05 20:27:47,908 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 62 flow [2022-12-05 20:27:47,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:47,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:47,911 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:47,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:27:47,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:47,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:47,916 INFO L85 PathProgramCache]: Analyzing trace with hash -332809833, now seen corresponding path program 1 times [2022-12-05 20:27:47,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:47,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034125178] [2022-12-05 20:27:47,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:47,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:48,552 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 20:27:48,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:48,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034125178] [2022-12-05 20:27:48,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034125178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:48,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:48,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:48,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184003213] [2022-12-05 20:27:48,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:48,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:48,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:48,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:27:48,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 62 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:48,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:48,554 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:27:48,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:48,988 INFO L130 PetriNetUnfolder]: 1310/1943 cut-off events. [2022-12-05 20:27:48,989 INFO L131 PetriNetUnfolder]: For 271/271 co-relation queries the response was YES. [2022-12-05 20:27:48,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1943 events. 1310/1943 cut-off events. For 271/271 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8493 event pairs, 182 based on Foata normal form. 9/1952 useless extension candidates. Maximal degree in co-relation 4350. Up to 1168 conditions per place. [2022-12-05 20:27:48,999 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 44 selfloop transitions, 16 changer transitions 0/60 dead transitions. [2022-12-05 20:27:48,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 277 flow [2022-12-05 20:27:49,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2022-12-05 20:27:49,006 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-05 20:27:49,006 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 62 flow. Second operand 5 states and 62 transitions. [2022-12-05 20:27:49,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 277 flow [2022-12-05 20:27:49,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:27:49,009 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 175 flow [2022-12-05 20:27:49,009 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2022-12-05 20:27:49,011 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2022-12-05 20:27:49,011 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 175 flow [2022-12-05 20:27:49,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:49,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:49,011 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:49,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:27:49,012 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:49,012 INFO L85 PathProgramCache]: Analyzing trace with hash 818536695, now seen corresponding path program 2 times [2022-12-05 20:27:49,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:49,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511416644] [2022-12-05 20:27:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:49,601 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 20:27:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:49,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511416644] [2022-12-05 20:27:49,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511416644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:49,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:49,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191126098] [2022-12-05 20:27:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:49,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:27:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:49,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:27:49,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:27:49,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-05 20:27:49,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 175 flow. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:49,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:49,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-05 20:27:49,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:50,009 INFO L130 PetriNetUnfolder]: 1666/2491 cut-off events. [2022-12-05 20:27:50,009 INFO L131 PetriNetUnfolder]: For 2506/2506 co-relation queries the response was YES. [2022-12-05 20:27:50,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 2491 events. 1666/2491 cut-off events. For 2506/2506 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11372 event pairs, 297 based on Foata normal form. 60/2551 useless extension candidates. Maximal degree in co-relation 7836. Up to 1020 conditions per place. [2022-12-05 20:27:50,020 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 40 selfloop transitions, 3 changer transitions 18/61 dead transitions. [2022-12-05 20:27:50,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 61 transitions, 396 flow [2022-12-05 20:27:50,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-05 20:27:50,022 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4375 [2022-12-05 20:27:50,022 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 175 flow. Second operand 4 states and 49 transitions. [2022-12-05 20:27:50,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 61 transitions, 396 flow [2022-12-05 20:27:50,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 388 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:50,029 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 124 flow [2022-12-05 20:27:50,029 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-05 20:27:50,031 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2022-12-05 20:27:50,031 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 124 flow [2022-12-05 20:27:50,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:50,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:50,031 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:50,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:27:50,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:50,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:50,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2015094150, now seen corresponding path program 1 times [2022-12-05 20:27:50,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:50,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502279807] [2022-12-05 20:27:50,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:50,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:50,936 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 20:27:50,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:50,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502279807] [2022-12-05 20:27:50,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502279807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:50,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:50,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:27:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651830849] [2022-12-05 20:27:50,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:50,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:27:50,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:27:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:27:50,939 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:50,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 124 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 20:27:50,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:50,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:50,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:51,262 INFO L130 PetriNetUnfolder]: 741/1163 cut-off events. [2022-12-05 20:27:51,262 INFO L131 PetriNetUnfolder]: For 1441/1441 co-relation queries the response was YES. [2022-12-05 20:27:51,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1163 events. 741/1163 cut-off events. For 1441/1441 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4601 event pairs, 190 based on Foata normal form. 1/1164 useless extension candidates. Maximal degree in co-relation 3821. Up to 1034 conditions per place. [2022-12-05 20:27:51,270 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 44 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2022-12-05 20:27:51,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 377 flow [2022-12-05 20:27:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:27:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:27:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-12-05 20:27:51,274 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3630952380952381 [2022-12-05 20:27:51,274 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 124 flow. Second operand 6 states and 61 transitions. [2022-12-05 20:27:51,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 377 flow [2022-12-05 20:27:51,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 59 transitions, 347 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-05 20:27:51,283 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 214 flow [2022-12-05 20:27:51,283 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2022-12-05 20:27:51,285 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2022-12-05 20:27:51,285 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 214 flow [2022-12-05 20:27:51,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 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 20:27:51,285 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:51,285 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:51,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:27:51,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:51,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1317549690, now seen corresponding path program 2 times [2022-12-05 20:27:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:51,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833107543] [2022-12-05 20:27:51,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:52,356 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 20:27:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:52,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833107543] [2022-12-05 20:27:52,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833107543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:52,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:52,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:27:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420810775] [2022-12-05 20:27:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:52,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:27:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:27:52,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:27:52,359 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:52,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 214 flow. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:52,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:52,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:52,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:52,806 INFO L130 PetriNetUnfolder]: 781/1223 cut-off events. [2022-12-05 20:27:52,806 INFO L131 PetriNetUnfolder]: For 2283/2283 co-relation queries the response was YES. [2022-12-05 20:27:52,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4440 conditions, 1223 events. 781/1223 cut-off events. For 2283/2283 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4960 event pairs, 195 based on Foata normal form. 3/1226 useless extension candidates. Maximal degree in co-relation 4422. Up to 641 conditions per place. [2022-12-05 20:27:52,815 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 62 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2022-12-05 20:27:52,815 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 80 transitions, 580 flow [2022-12-05 20:27:52,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:27:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:27:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-05 20:27:52,816 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3622448979591837 [2022-12-05 20:27:52,817 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 214 flow. Second operand 7 states and 71 transitions. [2022-12-05 20:27:52,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 80 transitions, 580 flow [2022-12-05 20:27:52,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 570 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-05 20:27:52,822 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 327 flow [2022-12-05 20:27:52,823 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=327, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2022-12-05 20:27:52,823 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2022-12-05 20:27:52,823 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 327 flow [2022-12-05 20:27:52,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:52,824 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:52,824 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:52,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:27:52,824 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:52,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:52,824 INFO L85 PathProgramCache]: Analyzing trace with hash 851865030, now seen corresponding path program 3 times [2022-12-05 20:27:52,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:52,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182211492] [2022-12-05 20:27:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:53,262 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 20:27:53,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:53,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182211492] [2022-12-05 20:27:53,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182211492] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:53,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:53,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860509632] [2022-12-05 20:27:53,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:53,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:27:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:53,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:27:53,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:27:53,265 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:53,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:53,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:53,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:53,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:53,625 INFO L130 PetriNetUnfolder]: 970/1505 cut-off events. [2022-12-05 20:27:53,626 INFO L131 PetriNetUnfolder]: For 4247/4247 co-relation queries the response was YES. [2022-12-05 20:27:53,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 1505 events. 970/1505 cut-off events. For 4247/4247 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6455 event pairs, 186 based on Foata normal form. 12/1517 useless extension candidates. Maximal degree in co-relation 6138. Up to 1118 conditions per place. [2022-12-05 20:27:53,638 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 54 selfloop transitions, 17 changer transitions 0/72 dead transitions. [2022-12-05 20:27:53,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 626 flow [2022-12-05 20:27:53,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:27:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:27:53,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-12-05 20:27:53,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34523809523809523 [2022-12-05 20:27:53,641 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 327 flow. Second operand 6 states and 58 transitions. [2022-12-05 20:27:53,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 626 flow [2022-12-05 20:27:53,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 573 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:53,646 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 419 flow [2022-12-05 20:27:53,646 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2022-12-05 20:27:53,648 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2022-12-05 20:27:53,648 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 419 flow [2022-12-05 20:27:53,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:53,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:53,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:53,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:27:53,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:53,649 INFO L85 PathProgramCache]: Analyzing trace with hash -703328492, now seen corresponding path program 1 times [2022-12-05 20:27:53,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:53,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824537665] [2022-12-05 20:27:53,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:53,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:54,833 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 20:27:54,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:54,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824537665] [2022-12-05 20:27:54,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824537665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:54,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:54,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:27:54,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170304208] [2022-12-05 20:27:54,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:54,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:27:54,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:54,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:27:54,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:27:54,836 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:54,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 419 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 20:27:54,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:54,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:54,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:55,177 INFO L130 PetriNetUnfolder]: 976/1515 cut-off events. [2022-12-05 20:27:55,178 INFO L131 PetriNetUnfolder]: For 6195/6195 co-relation queries the response was YES. [2022-12-05 20:27:55,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6888 conditions, 1515 events. 976/1515 cut-off events. For 6195/6195 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6586 event pairs, 163 based on Foata normal form. 2/1517 useless extension candidates. Maximal degree in co-relation 6866. Up to 1307 conditions per place. [2022-12-05 20:27:55,203 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 50 selfloop transitions, 25 changer transitions 0/76 dead transitions. [2022-12-05 20:27:55,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 76 transitions, 711 flow [2022-12-05 20:27:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-12-05 20:27:55,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:27:55,205 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 419 flow. Second operand 5 states and 55 transitions. [2022-12-05 20:27:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 76 transitions, 711 flow [2022-12-05 20:27:55,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 701 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:55,214 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 552 flow [2022-12-05 20:27:55,214 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=552, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2022-12-05 20:27:55,215 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2022-12-05 20:27:55,215 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 552 flow [2022-12-05 20:27:55,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 20:27:55,215 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:55,215 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:55,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:27:55,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:55,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 389664454, now seen corresponding path program 2 times [2022-12-05 20:27:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:55,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160794902] [2022-12-05 20:27:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:55,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:56,647 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 20:27:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:56,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160794902] [2022-12-05 20:27:56,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160794902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:56,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:56,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:27:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447406353] [2022-12-05 20:27:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:56,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:27:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:56,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:27:56,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:27:56,649 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:56,649 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 552 flow. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 20:27:56,649 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:56,649 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:56,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:57,155 INFO L130 PetriNetUnfolder]: 1028/1591 cut-off events. [2022-12-05 20:27:57,155 INFO L131 PetriNetUnfolder]: For 7421/7421 co-relation queries the response was YES. [2022-12-05 20:27:57,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7825 conditions, 1591 events. 1028/1591 cut-off events. For 7421/7421 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6976 event pairs, 159 based on Foata normal form. 2/1593 useless extension candidates. Maximal degree in co-relation 7802. Up to 1311 conditions per place. [2022-12-05 20:27:57,167 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 56 selfloop transitions, 31 changer transitions 0/88 dead transitions. [2022-12-05 20:27:57,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 918 flow [2022-12-05 20:27:57,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:27:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:27:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-12-05 20:27:57,169 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2022-12-05 20:27:57,169 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 552 flow. Second operand 6 states and 66 transitions. [2022-12-05 20:27:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 918 flow [2022-12-05 20:27:57,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 891 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:27:57,177 INFO L231 Difference]: Finished difference. Result has 59 places, 63 transitions, 696 flow [2022-12-05 20:27:57,178 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=696, PETRI_PLACES=59, PETRI_TRANSITIONS=63} [2022-12-05 20:27:57,178 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 22 predicate places. [2022-12-05 20:27:57,178 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 696 flow [2022-12-05 20:27:57,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 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 20:27:57,178 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:57,178 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:57,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:27:57,179 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:57,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:57,179 INFO L85 PathProgramCache]: Analyzing trace with hash 389664702, now seen corresponding path program 1 times [2022-12-05 20:27:57,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:57,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712336542] [2022-12-05 20:27:57,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:57,312 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 20:27:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:57,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712336542] [2022-12-05 20:27:57,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712336542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:57,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:57,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:27:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485767934] [2022-12-05 20:27:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:57,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:27:57,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:27:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:27:57,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:57,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 696 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:57,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:57,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:57,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:57,492 INFO L130 PetriNetUnfolder]: 590/986 cut-off events. [2022-12-05 20:27:57,492 INFO L131 PetriNetUnfolder]: For 6853/6853 co-relation queries the response was YES. [2022-12-05 20:27:57,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5158 conditions, 986 events. 590/986 cut-off events. For 6853/6853 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4204 event pairs, 103 based on Foata normal form. 67/1052 useless extension candidates. Maximal degree in co-relation 5134. Up to 705 conditions per place. [2022-12-05 20:27:57,499 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 76 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2022-12-05 20:27:57,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 1011 flow [2022-12-05 20:27:57,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:27:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:27:57,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 20:27:57,500 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-05 20:27:57,500 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 696 flow. Second operand 3 states and 41 transitions. [2022-12-05 20:27:57,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 1011 flow [2022-12-05 20:27:57,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 906 flow, removed 27 selfloop flow, removed 4 redundant places. [2022-12-05 20:27:57,509 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 551 flow [2022-12-05 20:27:57,509 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2022-12-05 20:27:57,510 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2022-12-05 20:27:57,510 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 551 flow [2022-12-05 20:27:57,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:57,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:57,510 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:57,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:27:57,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:57,511 INFO L85 PathProgramCache]: Analyzing trace with hash -971668889, now seen corresponding path program 1 times [2022-12-05 20:27:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:57,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113887776] [2022-12-05 20:27:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:27:57,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:57,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113887776] [2022-12-05 20:27:57,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113887776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:57,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:57,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:27:57,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750933949] [2022-12-05 20:27:57,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:57,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:27:57,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:57,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:27:57,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:27:57,679 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:57,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:57,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:57,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:57,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:57,823 INFO L130 PetriNetUnfolder]: 338/605 cut-off events. [2022-12-05 20:27:57,823 INFO L131 PetriNetUnfolder]: For 3616/3616 co-relation queries the response was YES. [2022-12-05 20:27:57,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3219 conditions, 605 events. 338/605 cut-off events. For 3616/3616 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2453 event pairs, 66 based on Foata normal form. 55/659 useless extension candidates. Maximal degree in co-relation 3194. Up to 269 conditions per place. [2022-12-05 20:27:57,827 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 85 selfloop transitions, 7 changer transitions 0/93 dead transitions. [2022-12-05 20:27:57,827 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 1056 flow [2022-12-05 20:27:57,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:27:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:27:57,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2022-12-05 20:27:57,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49107142857142855 [2022-12-05 20:27:57,829 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 551 flow. Second operand 4 states and 55 transitions. [2022-12-05 20:27:57,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 1056 flow [2022-12-05 20:27:57,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 1006 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-05 20:27:57,836 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 529 flow [2022-12-05 20:27:57,836 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=529, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2022-12-05 20:27:57,836 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2022-12-05 20:27:57,836 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 529 flow [2022-12-05 20:27:57,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:57,837 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:57,837 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 20:27:57,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:27:57,837 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:57,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1689630928, now seen corresponding path program 1 times [2022-12-05 20:27:57,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:57,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315522814] [2022-12-05 20:27:57,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:57,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:58,012 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 20:27:58,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:58,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315522814] [2022-12-05 20:27:58,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315522814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:58,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:58,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:27:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501403708] [2022-12-05 20:27:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:27:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:27:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:27:58,014 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:58,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 529 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:58,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:58,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:58,158 INFO L130 PetriNetUnfolder]: 305/539 cut-off events. [2022-12-05 20:27:58,159 INFO L131 PetriNetUnfolder]: For 3380/3380 co-relation queries the response was YES. [2022-12-05 20:27:58,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 539 events. 305/539 cut-off events. For 3380/3380 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2194 event pairs, 63 based on Foata normal form. 13/551 useless extension candidates. Maximal degree in co-relation 2803. Up to 269 conditions per place. [2022-12-05 20:27:58,163 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 82 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2022-12-05 20:27:58,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 1034 flow [2022-12-05 20:27:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:27:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:27:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-12-05 20:27:58,164 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 20:27:58,164 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 529 flow. Second operand 5 states and 56 transitions. [2022-12-05 20:27:58,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 1034 flow [2022-12-05 20:27:58,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 93 transitions, 919 flow, removed 48 selfloop flow, removed 4 redundant places. [2022-12-05 20:27:58,172 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 480 flow [2022-12-05 20:27:58,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=480, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2022-12-05 20:27:58,173 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 25 predicate places. [2022-12-05 20:27:58,174 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 480 flow [2022-12-05 20:27:58,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:58,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:58,174 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:58,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:27:58,174 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:58,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash -818855277, now seen corresponding path program 1 times [2022-12-05 20:27:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:58,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940012980] [2022-12-05 20:27:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:27:59,268 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 20:27:59,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:27:59,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940012980] [2022-12-05 20:27:59,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940012980] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:27:59,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:27:59,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:27:59,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967342828] [2022-12-05 20:27:59,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:27:59,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:27:59,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:27:59,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:27:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:27:59,270 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:27:59,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 480 flow. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:59,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:27:59,271 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:27:59,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:27:59,618 INFO L130 PetriNetUnfolder]: 404/720 cut-off events. [2022-12-05 20:27:59,619 INFO L131 PetriNetUnfolder]: For 3418/3424 co-relation queries the response was YES. [2022-12-05 20:27:59,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 720 events. 404/720 cut-off events. For 3418/3424 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3132 event pairs, 59 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 3577. Up to 434 conditions per place. [2022-12-05 20:27:59,624 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 59 selfloop transitions, 14 changer transitions 36/110 dead transitions. [2022-12-05 20:27:59,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 1104 flow [2022-12-05 20:27:59,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:27:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:27:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 66 transitions. [2022-12-05 20:27:59,626 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.336734693877551 [2022-12-05 20:27:59,626 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 480 flow. Second operand 7 states and 66 transitions. [2022-12-05 20:27:59,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 1104 flow [2022-12-05 20:27:59,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 110 transitions, 1016 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-05 20:27:59,637 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 520 flow [2022-12-05 20:27:59,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=520, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2022-12-05 20:27:59,637 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2022-12-05 20:27:59,638 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 520 flow [2022-12-05 20:27:59,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:27:59,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:27:59,638 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:27:59,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:27:59,638 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:27:59,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:27:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash 870322941, now seen corresponding path program 2 times [2022-12-05 20:27:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:27:59,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891538441] [2022-12-05 20:27:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:27:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:27:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:00,005 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 20:28:00,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:00,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891538441] [2022-12-05 20:28:00,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891538441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:00,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:00,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:28:00,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320703719] [2022-12-05 20:28:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:00,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:28:00,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:00,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:28:00,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:28:00,007 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:00,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 520 flow. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 20:28:00,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:00,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:00,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:00,247 INFO L130 PetriNetUnfolder]: 441/799 cut-off events. [2022-12-05 20:28:00,247 INFO L131 PetriNetUnfolder]: For 3533/3539 co-relation queries the response was YES. [2022-12-05 20:28:00,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3858 conditions, 799 events. 441/799 cut-off events. For 3533/3539 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3684 event pairs, 111 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 3837. Up to 489 conditions per place. [2022-12-05 20:28:00,252 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 51 selfloop transitions, 17 changer transitions 39/108 dead transitions. [2022-12-05 20:28:00,252 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 1063 flow [2022-12-05 20:28:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:00,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2022-12-05 20:28:00,253 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3869047619047619 [2022-12-05 20:28:00,253 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 520 flow. Second operand 6 states and 65 transitions. [2022-12-05 20:28:00,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 1063 flow [2022-12-05 20:28:00,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 108 transitions, 1040 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-05 20:28:00,265 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 573 flow [2022-12-05 20:28:00,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=573, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2022-12-05 20:28:00,266 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 31 predicate places. [2022-12-05 20:28:00,266 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 573 flow [2022-12-05 20:28:00,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 20:28:00,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:00,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:00,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:28:00,266 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:00,267 INFO L85 PathProgramCache]: Analyzing trace with hash -226824001, now seen corresponding path program 3 times [2022-12-05 20:28:00,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:00,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143231709] [2022-12-05 20:28:00,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:00,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:01,284 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 20:28:01,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:01,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143231709] [2022-12-05 20:28:01,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143231709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:01,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:01,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:28:01,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923380329] [2022-12-05 20:28:01,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:01,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:28:01,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:01,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:28:01,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:28:01,286 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:01,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 573 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:01,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:01,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:01,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:01,711 INFO L130 PetriNetUnfolder]: 427/780 cut-off events. [2022-12-05 20:28:01,711 INFO L131 PetriNetUnfolder]: For 4120/4126 co-relation queries the response was YES. [2022-12-05 20:28:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4041 conditions, 780 events. 427/780 cut-off events. For 4120/4126 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3602 event pairs, 25 based on Foata normal form. 1/780 useless extension candidates. Maximal degree in co-relation 4019. Up to 390 conditions per place. [2022-12-05 20:28:01,718 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 61 selfloop transitions, 29 changer transitions 34/125 dead transitions. [2022-12-05 20:28:01,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 125 transitions, 1265 flow [2022-12-05 20:28:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:28:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:28:01,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-12-05 20:28:01,719 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36607142857142855 [2022-12-05 20:28:01,719 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 573 flow. Second operand 8 states and 82 transitions. [2022-12-05 20:28:01,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 125 transitions, 1265 flow [2022-12-05 20:28:01,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 1158 flow, removed 36 selfloop flow, removed 7 redundant places. [2022-12-05 20:28:01,732 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 713 flow [2022-12-05 20:28:01,732 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2022-12-05 20:28:01,733 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2022-12-05 20:28:01,733 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 713 flow [2022-12-05 20:28:01,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:01,733 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:01,733 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:01,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:28:01,734 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:01,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1258507769, now seen corresponding path program 4 times [2022-12-05 20:28:01,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:01,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747666882] [2022-12-05 20:28:01,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:01,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:02,823 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 20:28:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:02,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747666882] [2022-12-05 20:28:02,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747666882] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:02,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:02,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:02,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622514436] [2022-12-05 20:28:02,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:02,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:02,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:02,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:02,824 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:02,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 713 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:02,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:02,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:02,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:03,137 INFO L130 PetriNetUnfolder]: 395/718 cut-off events. [2022-12-05 20:28:03,137 INFO L131 PetriNetUnfolder]: For 4232/4238 co-relation queries the response was YES. [2022-12-05 20:28:03,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 718 events. 395/718 cut-off events. For 4232/4238 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3221 event pairs, 39 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 3856. Up to 525 conditions per place. [2022-12-05 20:28:03,142 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 53 selfloop transitions, 30 changer transitions 17/101 dead transitions. [2022-12-05 20:28:03,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 101 transitions, 1146 flow [2022-12-05 20:28:03,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:28:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:28:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-12-05 20:28:03,143 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3273809523809524 [2022-12-05 20:28:03,143 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 713 flow. Second operand 6 states and 55 transitions. [2022-12-05 20:28:03,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 101 transitions, 1146 flow [2022-12-05 20:28:03,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 101 transitions, 1091 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:03,156 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 739 flow [2022-12-05 20:28:03,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=739, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2022-12-05 20:28:03,156 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2022-12-05 20:28:03,156 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 739 flow [2022-12-05 20:28:03,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:03,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:03,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:03,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:28:03,157 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:03,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2043646071, now seen corresponding path program 5 times [2022-12-05 20:28:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689759187] [2022-12-05 20:28:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:04,177 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 20:28:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:04,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689759187] [2022-12-05 20:28:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689759187] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:04,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:04,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:28:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827550788] [2022-12-05 20:28:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:28:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:28:04,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:28:04,179 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:04,179 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 739 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:04,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:04,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:04,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:04,537 INFO L130 PetriNetUnfolder]: 374/692 cut-off events. [2022-12-05 20:28:04,538 INFO L131 PetriNetUnfolder]: For 4697/4703 co-relation queries the response was YES. [2022-12-05 20:28:04,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3842 conditions, 692 events. 374/692 cut-off events. For 4697/4703 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3127 event pairs, 63 based on Foata normal form. 7/699 useless extension candidates. Maximal degree in co-relation 3812. Up to 348 conditions per place. [2022-12-05 20:28:04,542 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 59 selfloop transitions, 30 changer transitions 17/107 dead transitions. [2022-12-05 20:28:04,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 107 transitions, 1271 flow [2022-12-05 20:28:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-12-05 20:28:04,544 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28061224489795916 [2022-12-05 20:28:04,544 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 739 flow. Second operand 7 states and 55 transitions. [2022-12-05 20:28:04,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 107 transitions, 1271 flow [2022-12-05 20:28:04,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 1068 flow, removed 62 selfloop flow, removed 8 redundant places. [2022-12-05 20:28:04,557 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 672 flow [2022-12-05 20:28:04,557 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=672, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2022-12-05 20:28:04,557 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2022-12-05 20:28:04,557 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 672 flow [2022-12-05 20:28:04,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:04,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:04,558 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:04,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 20:28:04,558 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:04,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 346585577, now seen corresponding path program 6 times [2022-12-05 20:28:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:04,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642630208] [2022-12-05 20:28:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:05,529 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 20:28:05,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:05,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642630208] [2022-12-05 20:28:05,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642630208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:05,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:05,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:28:05,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886998558] [2022-12-05 20:28:05,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:05,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:28:05,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:05,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:28:05,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:28:05,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:05,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 672 flow. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:05,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:05,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:05,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:05,781 INFO L130 PetriNetUnfolder]: 338/634 cut-off events. [2022-12-05 20:28:05,781 INFO L131 PetriNetUnfolder]: For 3412/3418 co-relation queries the response was YES. [2022-12-05 20:28:05,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 634 events. 338/634 cut-off events. For 3412/3418 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2793 event pairs, 45 based on Foata normal form. 1/634 useless extension candidates. Maximal degree in co-relation 3319. Up to 349 conditions per place. [2022-12-05 20:28:05,786 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 58 selfloop transitions, 21 changer transitions 36/116 dead transitions. [2022-12-05 20:28:05,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 116 transitions, 1253 flow [2022-12-05 20:28:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:05,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-12-05 20:28:05,788 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-05 20:28:05,788 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 672 flow. Second operand 7 states and 63 transitions. [2022-12-05 20:28:05,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 116 transitions, 1253 flow [2022-12-05 20:28:05,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 1215 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-12-05 20:28:05,799 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 691 flow [2022-12-05 20:28:05,799 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2022-12-05 20:28:05,799 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2022-12-05 20:28:05,799 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 691 flow [2022-12-05 20:28:05,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 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 20:28:05,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:05,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:05,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 20:28:05,800 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:05,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash -16190175, now seen corresponding path program 7 times [2022-12-05 20:28:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:05,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845221571] [2022-12-05 20:28:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:06,577 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 20:28:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:06,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845221571] [2022-12-05 20:28:06,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845221571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:06,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:06,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:28:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332057846] [2022-12-05 20:28:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:06,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:28:06,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:06,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:28:06,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:28:06,579 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:06,579 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 691 flow. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:06,579 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:06,579 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:06,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:06,863 INFO L130 PetriNetUnfolder]: 272/531 cut-off events. [2022-12-05 20:28:06,863 INFO L131 PetriNetUnfolder]: For 2518/2521 co-relation queries the response was YES. [2022-12-05 20:28:06,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 531 events. 272/531 cut-off events. For 2518/2521 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2419 event pairs, 39 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 2790. Up to 198 conditions per place. [2022-12-05 20:28:06,867 INFO L137 encePairwiseOnDemand]: 20/28 looper letters, 69 selfloop transitions, 23 changer transitions 21/114 dead transitions. [2022-12-05 20:28:06,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 114 transitions, 1195 flow [2022-12-05 20:28:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:28:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:28:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 63 transitions. [2022-12-05 20:28:06,868 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-05 20:28:06,868 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 691 flow. Second operand 7 states and 63 transitions. [2022-12-05 20:28:06,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 114 transitions, 1195 flow [2022-12-05 20:28:06,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 1114 flow, removed 28 selfloop flow, removed 6 redundant places. [2022-12-05 20:28:06,879 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 679 flow [2022-12-05 20:28:06,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=679, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2022-12-05 20:28:06,879 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2022-12-05 20:28:06,879 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 679 flow [2022-12-05 20:28:06,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:06,880 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:06,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:06,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 20:28:06,880 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1633356169, now seen corresponding path program 8 times [2022-12-05 20:28:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:06,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112871701] [2022-12-05 20:28:06,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:28:07,572 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 20:28:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:28:07,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112871701] [2022-12-05 20:28:07,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112871701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:28:07,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:28:07,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-05 20:28:07,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578628967] [2022-12-05 20:28:07,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:28:07,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-05 20:28:07,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:28:07,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-05 20:28:07,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-05 20:28:07,574 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2022-12-05 20:28:07,574 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 679 flow. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:07,574 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:28:07,574 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2022-12-05 20:28:07,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:28:07,995 INFO L130 PetriNetUnfolder]: 257/507 cut-off events. [2022-12-05 20:28:07,995 INFO L131 PetriNetUnfolder]: For 2659/2662 co-relation queries the response was YES. [2022-12-05 20:28:07,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 507 events. 257/507 cut-off events. For 2659/2662 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2252 event pairs, 32 based on Foata normal form. 4/511 useless extension candidates. Maximal degree in co-relation 2768. Up to 195 conditions per place. [2022-12-05 20:28:07,998 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 46 selfloop transitions, 12 changer transitions 56/115 dead transitions. [2022-12-05 20:28:07,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 115 transitions, 1235 flow [2022-12-05 20:28:07,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 20:28:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 20:28:08,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 73 transitions. [2022-12-05 20:28:08,001 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.237012987012987 [2022-12-05 20:28:08,001 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 679 flow. Second operand 11 states and 73 transitions. [2022-12-05 20:28:08,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 115 transitions, 1235 flow [2022-12-05 20:28:08,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 1095 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-12-05 20:28:08,022 INFO L231 Difference]: Finished difference. Result has 79 places, 47 transitions, 395 flow [2022-12-05 20:28:08,022 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=395, PETRI_PLACES=79, PETRI_TRANSITIONS=47} [2022-12-05 20:28:08,022 INFO L294 CegarLoopForPetriNet]: 37 programPoint places, 42 predicate places. [2022-12-05 20:28:08,022 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 47 transitions, 395 flow [2022-12-05 20:28:08,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:28:08,024 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:28:08,024 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:08,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 20:28:08,024 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:28:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:28:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -486295683, now seen corresponding path program 9 times [2022-12-05 20:28:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:28:08,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683407102] [2022-12-05 20:28:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:28:08,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:28:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:08,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:28:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:28:08,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:28:08,185 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:28:08,187 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:28:08,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:28:08,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:28:08,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:28:08,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:28:08,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:28:08,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-05 20:28:08,189 INFO L458 BasicCegarLoop]: Path program histogram: [9, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-05 20:28:08,195 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:28:08,195 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:28:08,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:28:08 BasicIcfg [2022-12-05 20:28:08,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:28:08,272 INFO L158 Benchmark]: Toolchain (without parser) took 29282.10ms. Allocated memory was 189.8MB in the beginning and 607.1MB in the end (delta: 417.3MB). Free memory was 164.8MB in the beginning and 508.8MB in the end (delta: -344.1MB). Peak memory consumption was 74.0MB. Max. memory is 8.0GB. [2022-12-05 20:28:08,272 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 189.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:08,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.10ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 135.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-05 20:28:08,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.36ms. Allocated memory is still 189.8MB. Free memory was 135.1MB in the beginning and 132.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:08,273 INFO L158 Benchmark]: Boogie Preprocessor took 32.49ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 129.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:28:08,273 INFO L158 Benchmark]: RCFGBuilder took 763.14ms. Allocated memory is still 189.8MB. Free memory was 129.9MB in the beginning and 80.6MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. [2022-12-05 20:28:08,273 INFO L158 Benchmark]: TraceAbstraction took 27843.61ms. Allocated memory was 189.8MB in the beginning and 607.1MB in the end (delta: 417.3MB). Free memory was 80.1MB in the beginning and 508.8MB in the end (delta: -428.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:28:08,274 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.19ms. Allocated memory is still 189.8MB. Free memory is still 167.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.10ms. Allocated memory is still 189.8MB. Free memory was 164.8MB in the beginning and 135.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.36ms. Allocated memory is still 189.8MB. Free memory was 135.1MB in the beginning and 132.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.49ms. Allocated memory is still 189.8MB. Free memory was 132.5MB in the beginning and 129.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 763.14ms. Allocated memory is still 189.8MB. Free memory was 129.9MB in the beginning and 80.6MB in the end (delta: 49.3MB). Peak memory consumption was 49.3MB. Max. memory is 8.0GB. * TraceAbstraction took 27843.61ms. Allocated memory was 189.8MB in the beginning and 607.1MB in the end (delta: 417.3MB). Free memory was 80.1MB in the beginning and 508.8MB in the end (delta: -428.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 114 PlacesBefore, 37 PlacesAfterwards, 106 TransitionsBefore, 28 TransitionsAfterwards, 2022 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 38 TrivialYvCompositions, 42 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1577, independent: 1516, independent conditional: 1516, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1577, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1577, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1577, independent: 1516, independent conditional: 0, independent unconditional: 1516, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1268, independent: 1220, independent conditional: 0, independent unconditional: 1220, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1268, independent: 1213, independent conditional: 0, independent unconditional: 1213, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 384, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1577, independent: 296, independent conditional: 0, independent unconditional: 296, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 1268, unknown conditional: 0, unknown unconditional: 1268] , Statistics on independence cache: Total cache size (in pairs): 2046, Positive cache size: 1998, Positive conditional cache size: 0, Positive unconditional cache size: 1998, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2321; [L855] FCALL, FORK 0 pthread_create(&t2321, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2321, ((void *)0), P0, ((void *)0))=-2, t2321={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] [L856] 0 pthread_t t2322; [L857] FCALL, FORK 0 pthread_create(&t2322, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2322, ((void *)0), P1, ((void *)0))=-1, t2321={5:0}, t2322={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] [L858] 0 pthread_t t2323; [L859] FCALL, FORK 0 pthread_create(&t2323, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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(&t2323, ((void *)0), P2, ((void *)0))=0, t2321={5:0}, t2322={6:0}, t2323={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] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __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=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __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=0, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] 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) [L821] 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)) [L822] 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)) [L823] 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)) [L824] 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)) [L825] 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)) [L826] 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)) [L827] 3 __unbuffered_p2_EBX = y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=67, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] 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) [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=67, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L744] 1 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=67, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=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=67, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __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=68, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __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=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 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 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 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 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2321={5:0}, t2322={6:0}, t2323={3:0}, weak$$choice0=68, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 859]: 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: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.6s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 710 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 307 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2400 IncrementalHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 307 mSolverCounterUnsat, 3 mSDtfsCounter, 2400 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=739occurred in iteration=17, InterpolantAutomatonStates: 119, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 379 NumberOfCodeBlocks, 379 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 4980 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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 20:28:08,295 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...