/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:21:03,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:21:03,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:21:03,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:21:03,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:21:03,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:21:03,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:21:03,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:21:03,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:21:03,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:21:03,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:21:03,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:21:03,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:21:03,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:21:03,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:21:03,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:21:03,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:21:03,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:21:03,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:21:03,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:21:03,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:21:03,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:21:03,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:21:03,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:21:03,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:21:03,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:21:03,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:21:03,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:21:03,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:21:03,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:21:03,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:21:03,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:21:03,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:21:03,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:21:03,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:21:03,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:21:03,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:21:03,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:21:03,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:21:03,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:21:03,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:21:03,609 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:21:03,638 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:21:03,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:21:03,640 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:21:03,640 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:21:03,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:21:03,641 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:21:03,641 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:21:03,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:21:03,657 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:21:03,658 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:21:03,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:21:03,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:21:03,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:21:03,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:21:03,659 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:21:03,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:21:03,659 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:21:03,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:21:03,660 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:21:03,660 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:21:03,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:21:03,660 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:21:03,660 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:21:03,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:21:03,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:21:04,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:21:04,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:21:04,001 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:21:04,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-05 20:21:04,920 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:21:05,161 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:21:05,161 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2022-12-05 20:21:05,169 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5711122ea/df5718c5321e402a98b06ba5f59e1ec4/FLAGe4e4981b3 [2022-12-05 20:21:05,194 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5711122ea/df5718c5321e402a98b06ba5f59e1ec4 [2022-12-05 20:21:05,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:21:05,197 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:21:05,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:21:05,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:21:05,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:21:05,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db57f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05, skipping insertion in model container [2022-12-05 20:21:05,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:21:05,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:21:05,341 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/mix021_tso.oepc.i[949,962] [2022-12-05 20:21:05,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,499 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:21:05,546 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:21:05,554 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/mix021_tso.oepc.i[949,962] [2022-12-05 20:21:05,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,576 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,577 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,578 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,609 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:21:05,615 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:21:05,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:21:05,645 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:21:05,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05 WrapperNode [2022-12-05 20:21:05,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:21:05,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:21:05,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:21:05,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:21:05,651 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:21:05" (1/1) ... [2022-12-05 20:21:05,675 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:21:05" (1/1) ... [2022-12-05 20:21:05,694 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-12-05 20:21:05,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:21:05,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:21:05,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:21:05,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:21:05,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,723 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:21:05,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:21:05,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:21:05,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:21:05,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (1/1) ... [2022-12-05 20:21:05,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:21:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:21:05,785 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:21:05,792 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:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:21:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:21:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:21:05,810 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:21:05,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:21:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-05 20:21:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-05 20:21:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:21:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:21:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:21:05,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:21:05,812 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:21:05,915 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:21:05,916 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:21:06,172 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:21:06,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:21:06,275 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:21:06,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:21:06 BoogieIcfgContainer [2022-12-05 20:21:06,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:21:06,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:21:06,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:21:06,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:21:06,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:21:05" (1/3) ... [2022-12-05 20:21:06,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2357460f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:21:06, skipping insertion in model container [2022-12-05 20:21:06,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:21:05" (2/3) ... [2022-12-05 20:21:06,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2357460f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:21:06, skipping insertion in model container [2022-12-05 20:21:06,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:21:06" (3/3) ... [2022-12-05 20:21:06,282 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2022-12-05 20:21:06,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:21:06,295 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:21:06,295 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:21:06,357 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:21:06,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:21:06,475 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:21:06,476 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:06,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:21:06,482 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2022-12-05 20:21:06,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2022-12-05 20:21:06,489 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:21:06,514 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:21:06,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2022-12-05 20:21:06,549 INFO L130 PetriNetUnfolder]: 2/125 cut-off events. [2022-12-05 20:21:06,554 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:06,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-05 20:21:06,559 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2022-12-05 20:21:06,559 INFO L188 LiptonReduction]: Number of co-enabled transitions 2986 [2022-12-05 20:21:11,693 INFO L203 LiptonReduction]: Total number of compositions: 96 [2022-12-05 20:21:11,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:21:11,707 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;@3794ca4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:21:11,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:21:11,710 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-12-05 20:21:11,710 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:21:11,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:11,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:11,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash -375403712, now seen corresponding path program 1 times [2022-12-05 20:21:11,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:11,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161606490] [2022-12-05 20:21:11,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:11,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:12,087 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:21:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:12,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161606490] [2022-12-05 20:21:12,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161606490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:12,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:12,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:21:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320658966] [2022-12-05 20:21:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:12,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:12,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:12,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:12,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:12,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:21:12,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:21:12,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:12,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:21:12,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:12,651 INFO L130 PetriNetUnfolder]: 3519/5103 cut-off events. [2022-12-05 20:21:12,651 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 20:21:12,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 5103 events. 3519/5103 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 27245 event pairs, 954 based on Foata normal form. 0/4619 useless extension candidates. Maximal degree in co-relation 10071. Up to 3826 conditions per place. [2022-12-05 20:21:12,672 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 33 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2022-12-05 20:21:12,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2022-12-05 20:21:12,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-05 20:21:12,680 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2022-12-05 20:21:12,681 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 61 transitions. [2022-12-05 20:21:12,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2022-12-05 20:21:12,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-05 20:21:12,685 INFO L231 Difference]: Finished difference. Result has 41 places, 27 transitions, 66 flow [2022-12-05 20:21:12,686 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=41, PETRI_TRANSITIONS=27} [2022-12-05 20:21:12,688 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-05 20:21:12,689 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 27 transitions, 66 flow [2022-12-05 20:21:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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:21:12,689 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:12,689 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:12,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:21:12,689 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash 879830714, now seen corresponding path program 1 times [2022-12-05 20:21:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:12,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724040947] [2022-12-05 20:21:12,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:12,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:12,866 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:21:12,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:12,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724040947] [2022-12-05 20:21:12,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724040947] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:12,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:12,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:21:12,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750296799] [2022-12-05 20:21:12,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:12,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:12,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:12,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:12,869 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:12,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:21:12,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:12,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:12,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:13,243 INFO L130 PetriNetUnfolder]: 3047/4384 cut-off events. [2022-12-05 20:21:13,243 INFO L131 PetriNetUnfolder]: For 278/278 co-relation queries the response was YES. [2022-12-05 20:21:13,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9046 conditions, 4384 events. 3047/4384 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 22276 event pairs, 959 based on Foata normal form. 32/4367 useless extension candidates. Maximal degree in co-relation 9036. Up to 3903 conditions per place. [2022-12-05 20:21:13,262 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-05 20:21:13,262 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 188 flow [2022-12-05 20:21:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:13,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:13,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-05 20:21:13,263 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2022-12-05 20:21:13,263 INFO L175 Difference]: Start difference. First operand has 41 places, 27 transitions, 66 flow. Second operand 3 states and 53 transitions. [2022-12-05 20:21:13,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 188 flow [2022-12-05 20:21:13,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:13,265 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2022-12-05 20:21:13,265 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-12-05 20:21:13,266 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -6 predicate places. [2022-12-05 20:21:13,266 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2022-12-05 20:21:13,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:21:13,266 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:13,266 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:13,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:21:13,266 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:13,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1504948492, now seen corresponding path program 1 times [2022-12-05 20:21:13,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:13,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715737380] [2022-12-05 20:21:13,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:13,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:13,631 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:21:13,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:13,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715737380] [2022-12-05 20:21:13,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715737380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:13,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:13,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:21:13,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129642293] [2022-12-05 20:21:13,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:13,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:13,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:13,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:13,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:13,636 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:21:13,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 4 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:21:13,636 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:13,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:21:13,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:14,465 INFO L130 PetriNetUnfolder]: 8565/11734 cut-off events. [2022-12-05 20:21:14,465 INFO L131 PetriNetUnfolder]: For 1469/1469 co-relation queries the response was YES. [2022-12-05 20:21:14,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25551 conditions, 11734 events. 8565/11734 cut-off events. For 1469/1469 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 55403 event pairs, 2151 based on Foata normal form. 380/12114 useless extension candidates. Maximal degree in co-relation 25540. Up to 7215 conditions per place. [2022-12-05 20:21:14,518 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 46 selfloop transitions, 12 changer transitions 0/58 dead transitions. [2022-12-05 20:21:14,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 267 flow [2022-12-05 20:21:14,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:14,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-12-05 20:21:14,521 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2022-12-05 20:21:14,522 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 4 states and 56 transitions. [2022-12-05 20:21:14,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 267 flow [2022-12-05 20:21:14,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:14,526 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 176 flow [2022-12-05 20:21:14,526 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-05 20:21:14,527 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, -1 predicate places. [2022-12-05 20:21:14,527 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 176 flow [2022-12-05 20:21:14,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:21:14,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:14,528 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:21:14,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:14,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:14,528 INFO L85 PathProgramCache]: Analyzing trace with hash 22104845, now seen corresponding path program 1 times [2022-12-05 20:21:14,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:14,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140158925] [2022-12-05 20:21:14,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:14,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:14,795 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:21:14,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:14,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140158925] [2022-12-05 20:21:14,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140158925] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:14,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:14,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:21:14,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832328896] [2022-12-05 20:21:14,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:21:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:21:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:21:14,797 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:14,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:14,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:14,797 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:15,584 INFO L130 PetriNetUnfolder]: 6371/9214 cut-off events. [2022-12-05 20:21:15,584 INFO L131 PetriNetUnfolder]: For 6178/6291 co-relation queries the response was YES. [2022-12-05 20:21:15,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25460 conditions, 9214 events. 6371/9214 cut-off events. For 6178/6291 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 51332 event pairs, 1566 based on Foata normal form. 62/9004 useless extension candidates. Maximal degree in co-relation 25445. Up to 7525 conditions per place. [2022-12-05 20:21:15,637 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 45 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2022-12-05 20:21:15,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 58 transitions, 346 flow [2022-12-05 20:21:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:21:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:21:15,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-12-05 20:21:15,639 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5050505050505051 [2022-12-05 20:21:15,639 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 176 flow. Second operand 3 states and 50 transitions. [2022-12-05 20:21:15,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 58 transitions, 346 flow [2022-12-05 20:21:15,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 340 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:15,647 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 204 flow [2022-12-05 20:21:15,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2022-12-05 20:21:15,648 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-05 20:21:15,649 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 204 flow [2022-12-05 20:21:15,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:15,649 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:15,649 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:21:15,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:21:15,649 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:15,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:15,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1164196466, now seen corresponding path program 1 times [2022-12-05 20:21:15,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:15,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62897643] [2022-12-05 20:21:15,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:16,000 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:21:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:16,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62897643] [2022-12-05 20:21:16,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62897643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:16,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:16,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:16,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742078229] [2022-12-05 20:21:16,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:16,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:16,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:16,004 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:21:16,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 204 flow. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:16,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:16,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:21:16,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:16,972 INFO L130 PetriNetUnfolder]: 10649/14718 cut-off events. [2022-12-05 20:21:16,972 INFO L131 PetriNetUnfolder]: For 11551/11551 co-relation queries the response was YES. [2022-12-05 20:21:16,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43231 conditions, 14718 events. 10649/14718 cut-off events. For 11551/11551 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 74990 event pairs, 3339 based on Foata normal form. 184/14902 useless extension candidates. Maximal degree in co-relation 43214. Up to 7881 conditions per place. [2022-12-05 20:21:17,086 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 64 selfloop transitions, 11 changer transitions 2/77 dead transitions. [2022-12-05 20:21:17,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 483 flow [2022-12-05 20:21:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:17,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-05 20:21:17,090 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2022-12-05 20:21:17,090 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 204 flow. Second operand 4 states and 62 transitions. [2022-12-05 20:21:17,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 483 flow [2022-12-05 20:21:17,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:17,097 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 263 flow [2022-12-05 20:21:17,097 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2022-12-05 20:21:17,098 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-05 20:21:17,098 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 263 flow [2022-12-05 20:21:17,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:17,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:17,099 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:17,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:21:17,099 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:17,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1961387065, now seen corresponding path program 1 times [2022-12-05 20:21:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:17,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894013793] [2022-12-05 20:21:17,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:17,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:17,461 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:21:17,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:17,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894013793] [2022-12-05 20:21:17,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894013793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:17,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:17,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:17,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298599450] [2022-12-05 20:21:17,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:17,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:21:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:21:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:21:17,464 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:17,464 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:17,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:17,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:18,330 INFO L130 PetriNetUnfolder]: 7548/10978 cut-off events. [2022-12-05 20:21:18,331 INFO L131 PetriNetUnfolder]: For 15212/15358 co-relation queries the response was YES. [2022-12-05 20:21:18,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33584 conditions, 10978 events. 7548/10978 cut-off events. For 15212/15358 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 63766 event pairs, 1129 based on Foata normal form. 198/10681 useless extension candidates. Maximal degree in co-relation 33564. Up to 8085 conditions per place. [2022-12-05 20:21:18,375 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 58 selfloop transitions, 7 changer transitions 1/76 dead transitions. [2022-12-05 20:21:18,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 513 flow [2022-12-05 20:21:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-05 20:21:18,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2022-12-05 20:21:18,376 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 263 flow. Second operand 4 states and 65 transitions. [2022-12-05 20:21:18,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 513 flow [2022-12-05 20:21:18,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 76 transitions, 503 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-12-05 20:21:18,382 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 274 flow [2022-12-05 20:21:18,383 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-05 20:21:18,383 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2022-12-05 20:21:18,383 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 274 flow [2022-12-05 20:21:18,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:18,383 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:18,384 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:21:18,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:21:18,384 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -318395554, now seen corresponding path program 1 times [2022-12-05 20:21:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:18,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363712908] [2022-12-05 20:21:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:18,746 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:21:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:18,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363712908] [2022-12-05 20:21:18,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363712908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:18,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:18,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:18,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193674791] [2022-12-05 20:21:18,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:18,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:18,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:18,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:18,748 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:18,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:18,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:18,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:18,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:19,929 INFO L130 PetriNetUnfolder]: 8583/12287 cut-off events. [2022-12-05 20:21:19,929 INFO L131 PetriNetUnfolder]: For 20148/20384 co-relation queries the response was YES. [2022-12-05 20:21:19,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38593 conditions, 12287 events. 8583/12287 cut-off events. For 20148/20384 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 69439 event pairs, 1675 based on Foata normal form. 201/11902 useless extension candidates. Maximal degree in co-relation 38570. Up to 8836 conditions per place. [2022-12-05 20:21:19,986 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 80 selfloop transitions, 38 changer transitions 8/136 dead transitions. [2022-12-05 20:21:19,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 136 transitions, 937 flow [2022-12-05 20:21:19,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:21:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:21:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-05 20:21:19,987 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2022-12-05 20:21:19,987 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 274 flow. Second operand 8 states and 121 transitions. [2022-12-05 20:21:19,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 136 transitions, 937 flow [2022-12-05 20:21:19,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 136 transitions, 899 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:19,996 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 595 flow [2022-12-05 20:21:19,996 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=595, PETRI_PLACES=64, PETRI_TRANSITIONS=79} [2022-12-05 20:21:19,997 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2022-12-05 20:21:19,997 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 595 flow [2022-12-05 20:21:19,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:19,997 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:19,997 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:21:19,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:21:19,997 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:19,998 INFO L85 PathProgramCache]: Analyzing trace with hash -233079896, now seen corresponding path program 1 times [2022-12-05 20:21:19,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:19,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972489280] [2022-12-05 20:21:19,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:19,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:20,090 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:21:20,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:20,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972489280] [2022-12-05 20:21:20,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972489280] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:20,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:20,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:20,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654067118] [2022-12-05 20:21:20,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:20,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:20,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:20,092 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 33 [2022-12-05 20:21:20,092 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 79 transitions, 595 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:20,092 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:20,092 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 33 [2022-12-05 20:21:20,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:20,949 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 166#(= ~x~0 1), 36#L806true, P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, 78#L853-3true, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), 176#true, Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:20,950 INFO L382 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2022-12-05 20:21:20,950 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:21:20,950 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:21:20,950 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2022-12-05 20:21:21,127 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), 36#L806true, P1Thread1of1ForFork1InUse, 71#L3true, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), 176#true, Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:21,127 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,128 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,128 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,128 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,133 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, 52#P2EXITtrue, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, 78#L853-3true, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:21,133 INFO L382 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,135 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,136 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,136 INFO L385 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2022-12-05 20:21:21,286 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 114#L864true, 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 36#L806true, 153#true, P3Thread1of1ForFork0InUse, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:21,287 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,287 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,287 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,287 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,291 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 71#L3true, 153#true, P3Thread1of1ForFork0InUse, 52#P2EXITtrue, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:21,292 INFO L382 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,292 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,292 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,292 INFO L385 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2022-12-05 20:21:21,405 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([373] L769-->L776: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd2~0_28 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_30 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_117 256) 0)))) (let ((.cse4 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_118 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_103 256) 0))))) (and (= (ite (or (and .cse0 (not (= 0 (mod v_~y$r_buff0_thd2~0_29 256)))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_102 256) 0)))) 0 v_~y$r_buff1_thd2~0_28) v_~y$r_buff1_thd2~0_27) (= (ite .cse2 0 v_~y$w_buff0_used~0_118) v_~y$w_buff0_used~0_117) (= v_~y$w_buff1_used~0_102 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_103)) (= v_~y$r_buff0_thd2~0_29 (ite .cse4 0 v_~y$r_buff0_thd2~0_30)) (= (ite .cse2 v_~y$w_buff0~0_39 (ite .cse3 v_~y$w_buff1~0_46 v_~y~0_62)) v_~y~0_61)))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_118, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_30, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_103} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_117, ~y$w_buff1~0=v_~y$w_buff1~0_46, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_29, ~y~0=v_~y~0_61, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_102} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][51], [111#L776true, 114#L864true, Black: 162#(and (= ~y$w_buff1~0 ~y$w_buff0~0) (= ~y~0 ~y$w_buff0~0) (= ~y$w_buff0~0 0)), 193#(= ~z~0 1), P0Thread1of1ForFork3InUse, Black: 167#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P2Thread1of1ForFork2InUse, 166#(= ~x~0 1), P1Thread1of1ForFork1InUse, 153#true, P3Thread1of1ForFork0InUse, 52#P2EXITtrue, Black: 173#(and (= ~y$w_buff1~0 0) (= ~y$w_buff1_used~0 0) (<= 0 ~y$w_buff0_used~0) (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y$w_buff0~0)) (= ~y~0 1)), 112#P0EXITtrue, Black: 151#(= ~x~0 0), Black: 183#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0))), 45#L822true, Black: 185#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), 176#true, Black: 179#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 156#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= 2 ~y$w_buff1~0)))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 181#(and (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0))), Black: 180#(and (= ~y$r_buff0_thd0~0 0) (not (= 2 ~y$w_buff1~0)) (= ~y~0 1)), Black: 155#(= ~__unbuffered_p3_EAX~0 0)]) [2022-12-05 20:21:21,405 INFO L382 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2022-12-05 20:21:21,405 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:21:21,405 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:21:21,406 INFO L385 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2022-12-05 20:21:21,645 INFO L130 PetriNetUnfolder]: 13047/18669 cut-off events. [2022-12-05 20:21:21,645 INFO L131 PetriNetUnfolder]: For 62532/62796 co-relation queries the response was YES. [2022-12-05 20:21:21,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69731 conditions, 18669 events. 13047/18669 cut-off events. For 62532/62796 co-relation queries the response was YES. Maximal size of possible extension queue 935. Compared 113699 event pairs, 1623 based on Foata normal form. 393/18762 useless extension candidates. Maximal degree in co-relation 69703. Up to 9840 conditions per place. [2022-12-05 20:21:21,713 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 106 selfloop transitions, 3 changer transitions 17/135 dead transitions. [2022-12-05 20:21:21,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 1231 flow [2022-12-05 20:21:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:21:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:21:21,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 20:21:21,715 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-05 20:21:21,715 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 595 flow. Second operand 4 states and 60 transitions. [2022-12-05 20:21:21,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 1231 flow [2022-12-05 20:21:21,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 135 transitions, 1229 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-05 20:21:21,842 INFO L231 Difference]: Finished difference. Result has 69 places, 80 transitions, 612 flow [2022-12-05 20:21:21,842 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=612, PETRI_PLACES=69, PETRI_TRANSITIONS=80} [2022-12-05 20:21:21,844 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2022-12-05 20:21:21,844 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 80 transitions, 612 flow [2022-12-05 20:21:21,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:21,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:21,844 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:21:21,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:21:21,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:21,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:21,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1268455498, now seen corresponding path program 2 times [2022-12-05 20:21:21,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:21,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172198549] [2022-12-05 20:21:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:21:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:22,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172198549] [2022-12-05 20:21:22,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172198549] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:22,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:22,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012734637] [2022-12-05 20:21:22,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:22,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:22,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:22,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:22,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:22,148 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:22,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 80 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:22,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:22,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:22,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:24,344 INFO L130 PetriNetUnfolder]: 15162/21943 cut-off events. [2022-12-05 20:21:24,344 INFO L131 PetriNetUnfolder]: For 73795/74413 co-relation queries the response was YES. [2022-12-05 20:21:24,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83002 conditions, 21943 events. 15162/21943 cut-off events. For 73795/74413 co-relation queries the response was YES. Maximal size of possible extension queue 1219. Compared 140637 event pairs, 1959 based on Foata normal form. 337/21455 useless extension candidates. Maximal degree in co-relation 82971. Up to 14456 conditions per place. [2022-12-05 20:21:24,539 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 90 selfloop transitions, 49 changer transitions 3/153 dead transitions. [2022-12-05 20:21:24,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 153 transitions, 1335 flow [2022-12-05 20:21:24,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:21:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:21:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-12-05 20:21:24,540 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.48917748917748916 [2022-12-05 20:21:24,540 INFO L175 Difference]: Start difference. First operand has 69 places, 80 transitions, 612 flow. Second operand 7 states and 113 transitions. [2022-12-05 20:21:24,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 153 transitions, 1335 flow [2022-12-05 20:21:24,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 153 transitions, 1329 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:24,743 INFO L231 Difference]: Finished difference. Result has 77 places, 99 transitions, 922 flow [2022-12-05 20:21:24,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=922, PETRI_PLACES=77, PETRI_TRANSITIONS=99} [2022-12-05 20:21:24,744 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 32 predicate places. [2022-12-05 20:21:24,744 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 99 transitions, 922 flow [2022-12-05 20:21:24,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:24,744 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:24,744 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:24,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:21:24,745 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 685336354, now seen corresponding path program 1 times [2022-12-05 20:21:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:24,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861543157] [2022-12-05 20:21:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:25,230 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:21:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:25,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861543157] [2022-12-05 20:21:25,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861543157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:25,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:25,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822563614] [2022-12-05 20:21:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:25,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:25,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:25,232 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:21:25,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 99 transitions, 922 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:21:25,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:25,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:21:25,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:27,778 INFO L130 PetriNetUnfolder]: 20320/28269 cut-off events. [2022-12-05 20:21:27,778 INFO L131 PetriNetUnfolder]: For 113580/113580 co-relation queries the response was YES. [2022-12-05 20:21:27,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122272 conditions, 28269 events. 20320/28269 cut-off events. For 113580/113580 co-relation queries the response was YES. Maximal size of possible extension queue 1087. Compared 163250 event pairs, 3003 based on Foata normal form. 32/28301 useless extension candidates. Maximal degree in co-relation 122237. Up to 22374 conditions per place. [2022-12-05 20:21:27,938 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 112 selfloop transitions, 51 changer transitions 20/183 dead transitions. [2022-12-05 20:21:27,938 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 183 transitions, 1896 flow [2022-12-05 20:21:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:21:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:21:27,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-12-05 20:21:27,939 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49696969696969695 [2022-12-05 20:21:27,939 INFO L175 Difference]: Start difference. First operand has 77 places, 99 transitions, 922 flow. Second operand 5 states and 82 transitions. [2022-12-05 20:21:27,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 183 transitions, 1896 flow [2022-12-05 20:21:28,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 183 transitions, 1776 flow, removed 34 selfloop flow, removed 3 redundant places. [2022-12-05 20:21:28,539 INFO L231 Difference]: Finished difference. Result has 82 places, 119 transitions, 1259 flow [2022-12-05 20:21:28,539 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1259, PETRI_PLACES=82, PETRI_TRANSITIONS=119} [2022-12-05 20:21:28,539 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2022-12-05 20:21:28,539 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 119 transitions, 1259 flow [2022-12-05 20:21:28,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 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:21:28,539 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:28,540 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:28,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:21:28,540 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 685307524, now seen corresponding path program 2 times [2022-12-05 20:21:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:28,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153766592] [2022-12-05 20:21:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:28,765 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:21:28,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:28,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153766592] [2022-12-05 20:21:28,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153766592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:28,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:28,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:28,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812171100] [2022-12-05 20:21:28,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:28,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:21:28,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:28,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:21:28,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:21:28,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:28,767 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 119 transitions, 1259 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:28,767 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:28,767 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:28,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:31,043 INFO L130 PetriNetUnfolder]: 15466/22482 cut-off events. [2022-12-05 20:21:31,044 INFO L131 PetriNetUnfolder]: For 140655/141938 co-relation queries the response was YES. [2022-12-05 20:21:31,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108735 conditions, 22482 events. 15466/22482 cut-off events. For 140655/141938 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 143143 event pairs, 4658 based on Foata normal form. 301/21635 useless extension candidates. Maximal degree in co-relation 108696. Up to 18668 conditions per place. [2022-12-05 20:21:31,158 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 117 selfloop transitions, 29 changer transitions 1/164 dead transitions. [2022-12-05 20:21:31,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 164 transitions, 1940 flow [2022-12-05 20:21:31,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:21:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:21:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-05 20:21:31,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46060606060606063 [2022-12-05 20:21:31,175 INFO L175 Difference]: Start difference. First operand has 82 places, 119 transitions, 1259 flow. Second operand 5 states and 76 transitions. [2022-12-05 20:21:31,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 164 transitions, 1940 flow [2022-12-05 20:21:31,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 164 transitions, 1882 flow, removed 29 selfloop flow, removed 0 redundant places. [2022-12-05 20:21:31,436 INFO L231 Difference]: Finished difference. Result has 89 places, 134 transitions, 1532 flow [2022-12-05 20:21:31,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1532, PETRI_PLACES=89, PETRI_TRANSITIONS=134} [2022-12-05 20:21:31,437 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2022-12-05 20:21:31,437 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 134 transitions, 1532 flow [2022-12-05 20:21:31,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:31,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:31,437 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:21:31,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:21:31,437 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash -329119384, now seen corresponding path program 3 times [2022-12-05 20:21:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:31,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379865197] [2022-12-05 20:21:31,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:31,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:31,688 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:21:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:31,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379865197] [2022-12-05 20:21:31,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379865197] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:31,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:31,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134469770] [2022-12-05 20:21:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:31,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:31,690 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:31,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 134 transitions, 1532 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:31,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:31,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:31,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:34,211 INFO L130 PetriNetUnfolder]: 15193/22306 cut-off events. [2022-12-05 20:21:34,211 INFO L131 PetriNetUnfolder]: For 159583/160784 co-relation queries the response was YES. [2022-12-05 20:21:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111825 conditions, 22306 events. 15193/22306 cut-off events. For 159583/160784 co-relation queries the response was YES. Maximal size of possible extension queue 1134. Compared 144148 event pairs, 2663 based on Foata normal form. 378/21879 useless extension candidates. Maximal degree in co-relation 111781. Up to 16342 conditions per place. [2022-12-05 20:21:34,327 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 114 selfloop transitions, 62 changer transitions 4/197 dead transitions. [2022-12-05 20:21:34,327 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 197 transitions, 2328 flow [2022-12-05 20:21:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:21:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:21:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2022-12-05 20:21:34,328 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-05 20:21:34,328 INFO L175 Difference]: Start difference. First operand has 89 places, 134 transitions, 1532 flow. Second operand 6 states and 102 transitions. [2022-12-05 20:21:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 197 transitions, 2328 flow [2022-12-05 20:21:34,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 197 transitions, 2277 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:34,625 INFO L231 Difference]: Finished difference. Result has 95 places, 147 transitions, 1833 flow [2022-12-05 20:21:34,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1481, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1833, PETRI_PLACES=95, PETRI_TRANSITIONS=147} [2022-12-05 20:21:34,625 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2022-12-05 20:21:34,625 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 147 transitions, 1833 flow [2022-12-05 20:21:34,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:21:34,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:34,625 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:21:34,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 20:21:34,626 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1476131003, now seen corresponding path program 1 times [2022-12-05 20:21:34,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:34,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515086336] [2022-12-05 20:21:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:34,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:35,110 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:21:35,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:35,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515086336] [2022-12-05 20:21:35,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515086336] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:35,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:35,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:35,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219749715] [2022-12-05 20:21:35,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:35,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:35,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:35,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:35,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:35,112 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:35,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 147 transitions, 1833 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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:21:35,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:35,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:37,552 INFO L130 PetriNetUnfolder]: 14891/21813 cut-off events. [2022-12-05 20:21:37,552 INFO L131 PetriNetUnfolder]: For 174323/175475 co-relation queries the response was YES. [2022-12-05 20:21:37,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112776 conditions, 21813 events. 14891/21813 cut-off events. For 174323/175475 co-relation queries the response was YES. Maximal size of possible extension queue 1121. Compared 139868 event pairs, 2832 based on Foata normal form. 392/21426 useless extension candidates. Maximal degree in co-relation 112729. Up to 13840 conditions per place. [2022-12-05 20:21:37,676 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 93 selfloop transitions, 67 changer transitions 10/187 dead transitions. [2022-12-05 20:21:37,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 187 transitions, 2430 flow [2022-12-05 20:21:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:21:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:21:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2022-12-05 20:21:37,677 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2022-12-05 20:21:37,677 INFO L175 Difference]: Start difference. First operand has 95 places, 147 transitions, 1833 flow. Second operand 5 states and 84 transitions. [2022-12-05 20:21:37,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 187 transitions, 2430 flow [2022-12-05 20:21:38,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 187 transitions, 2374 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 20:21:38,043 INFO L231 Difference]: Finished difference. Result has 98 places, 137 transitions, 1836 flow [2022-12-05 20:21:38,044 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1777, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1836, PETRI_PLACES=98, PETRI_TRANSITIONS=137} [2022-12-05 20:21:38,044 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2022-12-05 20:21:38,044 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 137 transitions, 1836 flow [2022-12-05 20:21:38,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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:21:38,044 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:38,044 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:21:38,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:21:38,044 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1614108199, now seen corresponding path program 1 times [2022-12-05 20:21:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:38,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079290365] [2022-12-05 20:21:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:38,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:38,486 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:21:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:38,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079290365] [2022-12-05 20:21:38,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079290365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:38,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:38,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:21:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655174720] [2022-12-05 20:21:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:38,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:21:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:21:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:21:38,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:38,488 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 137 transitions, 1836 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:21:38,488 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:38,488 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:38,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:40,769 INFO L130 PetriNetUnfolder]: 14999/22058 cut-off events. [2022-12-05 20:21:40,769 INFO L131 PetriNetUnfolder]: For 193187/194081 co-relation queries the response was YES. [2022-12-05 20:21:40,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116633 conditions, 22058 events. 14999/22058 cut-off events. For 193187/194081 co-relation queries the response was YES. Maximal size of possible extension queue 1178. Compared 143226 event pairs, 3160 based on Foata normal form. 252/21194 useless extension candidates. Maximal degree in co-relation 116584. Up to 16249 conditions per place. [2022-12-05 20:21:40,902 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 132 selfloop transitions, 43 changer transitions 3/195 dead transitions. [2022-12-05 20:21:40,903 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 195 transitions, 2549 flow [2022-12-05 20:21:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:21:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:21:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-05 20:21:40,904 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-05 20:21:40,904 INFO L175 Difference]: Start difference. First operand has 98 places, 137 transitions, 1836 flow. Second operand 8 states and 117 transitions. [2022-12-05 20:21:40,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 195 transitions, 2549 flow [2022-12-05 20:21:41,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 195 transitions, 2384 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-05 20:21:41,477 INFO L231 Difference]: Finished difference. Result has 100 places, 141 transitions, 1813 flow [2022-12-05 20:21:41,477 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1813, PETRI_PLACES=100, PETRI_TRANSITIONS=141} [2022-12-05 20:21:41,477 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2022-12-05 20:21:41,477 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 141 transitions, 1813 flow [2022-12-05 20:21:41,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:21:41,478 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:41,478 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:21:41,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-05 20:21:41,478 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1613691559, now seen corresponding path program 2 times [2022-12-05 20:21:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:41,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223332705] [2022-12-05 20:21:41,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:41,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:41,840 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:21:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:41,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223332705] [2022-12-05 20:21:41,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223332705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:41,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:41,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:21:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371984515] [2022-12-05 20:21:41,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:41,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:21:41,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:21:41,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:21:41,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:41,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 141 transitions, 1813 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:41,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:41,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:41,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:44,221 INFO L130 PetriNetUnfolder]: 15250/22485 cut-off events. [2022-12-05 20:21:44,221 INFO L131 PetriNetUnfolder]: For 188436/189353 co-relation queries the response was YES. [2022-12-05 20:21:44,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118238 conditions, 22485 events. 15250/22485 cut-off events. For 188436/189353 co-relation queries the response was YES. Maximal size of possible extension queue 1213. Compared 147189 event pairs, 3235 based on Foata normal form. 248/21617 useless extension candidates. Maximal degree in co-relation 118191. Up to 16306 conditions per place. [2022-12-05 20:21:44,369 INFO L137 encePairwiseOnDemand]: 25/33 looper letters, 131 selfloop transitions, 42 changer transitions 8/198 dead transitions. [2022-12-05 20:21:44,369 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 198 transitions, 2526 flow [2022-12-05 20:21:44,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:21:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:21:44,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2022-12-05 20:21:44,371 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2022-12-05 20:21:44,371 INFO L175 Difference]: Start difference. First operand has 100 places, 141 transitions, 1813 flow. Second operand 8 states and 117 transitions. [2022-12-05 20:21:44,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 198 transitions, 2526 flow [2022-12-05 20:21:44,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 198 transitions, 2453 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-12-05 20:21:44,907 INFO L231 Difference]: Finished difference. Result has 102 places, 141 transitions, 1823 flow [2022-12-05 20:21:44,908 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1742, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1823, PETRI_PLACES=102, PETRI_TRANSITIONS=141} [2022-12-05 20:21:44,908 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2022-12-05 20:21:44,908 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 141 transitions, 1823 flow [2022-12-05 20:21:44,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:44,908 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:44,909 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:21:44,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-05 20:21:44,909 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:44,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1350307721, now seen corresponding path program 3 times [2022-12-05 20:21:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:44,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729413524] [2022-12-05 20:21:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:45,274 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:21:45,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:45,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729413524] [2022-12-05 20:21:45,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729413524] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:45,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:45,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:21:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697593443] [2022-12-05 20:21:45,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:45,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:21:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:45,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:21:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:21:45,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:21:45,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 141 transitions, 1823 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:45,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:45,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:21:45,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:48,940 INFO L130 PetriNetUnfolder]: 20177/30252 cut-off events. [2022-12-05 20:21:48,940 INFO L131 PetriNetUnfolder]: For 264293/265497 co-relation queries the response was YES. [2022-12-05 20:21:49,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151343 conditions, 30252 events. 20177/30252 cut-off events. For 264293/265497 co-relation queries the response was YES. Maximal size of possible extension queue 1660. Compared 214454 event pairs, 3754 based on Foata normal form. 799/29669 useless extension candidates. Maximal degree in co-relation 151295. Up to 14682 conditions per place. [2022-12-05 20:21:49,111 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 114 selfloop transitions, 65 changer transitions 17/213 dead transitions. [2022-12-05 20:21:49,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 213 transitions, 2777 flow [2022-12-05 20:21:49,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:21:49,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:21:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-05 20:21:49,120 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2022-12-05 20:21:49,120 INFO L175 Difference]: Start difference. First operand has 102 places, 141 transitions, 1823 flow. Second operand 8 states and 114 transitions. [2022-12-05 20:21:49,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 213 transitions, 2777 flow [2022-12-05 20:21:49,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 213 transitions, 2671 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-05 20:21:49,828 INFO L231 Difference]: Finished difference. Result has 106 places, 149 transitions, 2052 flow [2022-12-05 20:21:49,828 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2052, PETRI_PLACES=106, PETRI_TRANSITIONS=149} [2022-12-05 20:21:49,829 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 61 predicate places. [2022-12-05 20:21:49,829 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 149 transitions, 2052 flow [2022-12-05 20:21:49,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:49,829 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:49,829 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:21:49,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-05 20:21:49,829 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:49,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:49,830 INFO L85 PathProgramCache]: Analyzing trace with hash -551630015, now seen corresponding path program 4 times [2022-12-05 20:21:49,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:49,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487342148] [2022-12-05 20:21:49,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:49,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:50,385 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:21:50,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:50,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487342148] [2022-12-05 20:21:50,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487342148] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:50,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:50,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:21:50,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431321940] [2022-12-05 20:21:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:50,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:21:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:50,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:21:50,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:21:50,386 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-05 20:21:50,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 149 transitions, 2052 flow. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:50,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:50,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-05 20:21:50,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:53,972 INFO L130 PetriNetUnfolder]: 24585/35470 cut-off events. [2022-12-05 20:21:53,972 INFO L131 PetriNetUnfolder]: For 271180/271180 co-relation queries the response was YES. [2022-12-05 20:21:54,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180731 conditions, 35470 events. 24585/35470 cut-off events. For 271180/271180 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 229354 event pairs, 4747 based on Foata normal form. 48/35518 useless extension candidates. Maximal degree in co-relation 180680. Up to 25283 conditions per place. [2022-12-05 20:21:54,327 INFO L137 encePairwiseOnDemand]: 20/33 looper letters, 143 selfloop transitions, 89 changer transitions 35/267 dead transitions. [2022-12-05 20:21:54,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 267 transitions, 3668 flow [2022-12-05 20:21:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:21:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:21:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-12-05 20:21:54,329 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2022-12-05 20:21:54,329 INFO L175 Difference]: Start difference. First operand has 106 places, 149 transitions, 2052 flow. Second operand 7 states and 111 transitions. [2022-12-05 20:21:54,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 267 transitions, 3668 flow [2022-12-05 20:21:56,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 267 transitions, 3621 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-12-05 20:21:56,095 INFO L231 Difference]: Finished difference. Result has 115 places, 177 transitions, 2759 flow [2022-12-05 20:21:56,096 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2759, PETRI_PLACES=115, PETRI_TRANSITIONS=177} [2022-12-05 20:21:56,101 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2022-12-05 20:21:56,101 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 177 transitions, 2759 flow [2022-12-05 20:21:56,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:21:56,101 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:21:56,105 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:21:56,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-05 20:21:56,105 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:21:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:21:56,105 INFO L85 PathProgramCache]: Analyzing trace with hash -343724525, now seen corresponding path program 1 times [2022-12-05 20:21:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:21:56,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868423365] [2022-12-05 20:21:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:21:56,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:21:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:21:56,227 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:21:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:21:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868423365] [2022-12-05 20:21:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868423365] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:21:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:21:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:21:56,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725347552] [2022-12-05 20:21:56,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:21:56,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:21:56,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:21:56,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:21:56,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:21:56,228 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:21:56,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 177 transitions, 2759 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:21:56,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:21:56,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:21:56,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:21:59,091 INFO L130 PetriNetUnfolder]: 14668/22382 cut-off events. [2022-12-05 20:21:59,092 INFO L131 PetriNetUnfolder]: For 383649/388644 co-relation queries the response was YES. [2022-12-05 20:21:59,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125800 conditions, 22382 events. 14668/22382 cut-off events. For 383649/388644 co-relation queries the response was YES. Maximal size of possible extension queue 1502. Compared 162152 event pairs, 3278 based on Foata normal form. 3676/25118 useless extension candidates. Maximal degree in co-relation 125744. Up to 14015 conditions per place. [2022-12-05 20:21:59,241 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 248 selfloop transitions, 9 changer transitions 52/341 dead transitions. [2022-12-05 20:21:59,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 341 transitions, 5898 flow [2022-12-05 20:21:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:21:59,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:21:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-12-05 20:21:59,256 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2022-12-05 20:21:59,256 INFO L175 Difference]: Start difference. First operand has 115 places, 177 transitions, 2759 flow. Second operand 5 states and 89 transitions. [2022-12-05 20:21:59,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 341 transitions, 5898 flow [2022-12-05 20:22:00,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 341 transitions, 5726 flow, removed 48 selfloop flow, removed 5 redundant places. [2022-12-05 20:22:00,436 INFO L231 Difference]: Finished difference. Result has 116 places, 174 transitions, 2597 flow [2022-12-05 20:22:00,436 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2464, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2597, PETRI_PLACES=116, PETRI_TRANSITIONS=174} [2022-12-05 20:22:00,436 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places. [2022-12-05 20:22:00,437 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 174 transitions, 2597 flow [2022-12-05 20:22:00,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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:22:00,437 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:00,437 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:00,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 20:22:00,451 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:00,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1834070375, now seen corresponding path program 1 times [2022-12-05 20:22:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:00,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703247718] [2022-12-05 20:22:00,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:00,556 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:22:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:00,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703247718] [2022-12-05 20:22:00,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703247718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:00,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:00,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364560915] [2022-12-05 20:22:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:00,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:00,557 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:00,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 174 transitions, 2597 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:22:00,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:00,557 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:02,918 INFO L130 PetriNetUnfolder]: 11033/17263 cut-off events. [2022-12-05 20:22:02,918 INFO L131 PetriNetUnfolder]: For 277940/283943 co-relation queries the response was YES. [2022-12-05 20:22:02,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104679 conditions, 17263 events. 11033/17263 cut-off events. For 277940/283943 co-relation queries the response was YES. Maximal size of possible extension queue 1166. Compared 126230 event pairs, 1004 based on Foata normal form. 3502/20181 useless extension candidates. Maximal degree in co-relation 104621. Up to 7918 conditions per place. [2022-12-05 20:22:03,027 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 247 selfloop transitions, 18 changer transitions 57/350 dead transitions. [2022-12-05 20:22:03,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 350 transitions, 5822 flow [2022-12-05 20:22:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:03,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2022-12-05 20:22:03,028 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5411255411255411 [2022-12-05 20:22:03,028 INFO L175 Difference]: Start difference. First operand has 116 places, 174 transitions, 2597 flow. Second operand 7 states and 125 transitions. [2022-12-05 20:22:03,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 350 transitions, 5822 flow [2022-12-05 20:22:03,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 350 transitions, 5473 flow, removed 56 selfloop flow, removed 9 redundant places. [2022-12-05 20:22:03,433 INFO L231 Difference]: Finished difference. Result has 113 places, 134 transitions, 1831 flow [2022-12-05 20:22:03,433 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1831, PETRI_PLACES=113, PETRI_TRANSITIONS=134} [2022-12-05 20:22:03,433 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places. [2022-12-05 20:22:03,434 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 134 transitions, 1831 flow [2022-12-05 20:22:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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:22:03,434 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:03,434 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:03,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-05 20:22:03,434 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:03,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -492811591, now seen corresponding path program 1 times [2022-12-05 20:22:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:03,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961089230] [2022-12-05 20:22:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:03,644 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:22:03,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:03,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961089230] [2022-12-05 20:22:03,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961089230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:03,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:03,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:03,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347671606] [2022-12-05 20:22:03,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:03,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:03,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:03,646 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:03,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 134 transitions, 1831 flow. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:03,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:03,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:03,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:05,803 INFO L130 PetriNetUnfolder]: 9813/15462 cut-off events. [2022-12-05 20:22:05,803 INFO L131 PetriNetUnfolder]: For 186107/192180 co-relation queries the response was YES. [2022-12-05 20:22:05,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98866 conditions, 15462 events. 9813/15462 cut-off events. For 186107/192180 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 113295 event pairs, 583 based on Foata normal form. 2411/17339 useless extension candidates. Maximal degree in co-relation 98809. Up to 6906 conditions per place. [2022-12-05 20:22:05,887 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 231 selfloop transitions, 25 changer transitions 90/373 dead transitions. [2022-12-05 20:22:05,888 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 373 transitions, 5815 flow [2022-12-05 20:22:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:22:05,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:22:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2022-12-05 20:22:05,889 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.531986531986532 [2022-12-05 20:22:05,889 INFO L175 Difference]: Start difference. First operand has 113 places, 134 transitions, 1831 flow. Second operand 9 states and 158 transitions. [2022-12-05 20:22:05,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 373 transitions, 5815 flow [2022-12-05 20:22:07,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 373 transitions, 5508 flow, removed 40 selfloop flow, removed 8 redundant places. [2022-12-05 20:22:07,146 INFO L231 Difference]: Finished difference. Result has 116 places, 122 transitions, 1545 flow [2022-12-05 20:22:07,146 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1545, PETRI_PLACES=116, PETRI_TRANSITIONS=122} [2022-12-05 20:22:07,146 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places. [2022-12-05 20:22:07,147 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 122 transitions, 1545 flow [2022-12-05 20:22:07,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:07,147 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:07,147 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:07,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-05 20:22:07,147 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:07,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:07,147 INFO L85 PathProgramCache]: Analyzing trace with hash 63111032, now seen corresponding path program 1 times [2022-12-05 20:22:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:07,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437680180] [2022-12-05 20:22:07,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:07,257 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:22:07,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:07,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437680180] [2022-12-05 20:22:07,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437680180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:07,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:07,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:22:07,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758291646] [2022-12-05 20:22:07,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:07,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:22:07,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:07,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:22:07,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:22:07,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2022-12-05 20:22:07,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 122 transitions, 1545 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:22:07,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:07,260 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2022-12-05 20:22:07,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:08,943 INFO L130 PetriNetUnfolder]: 8858/14124 cut-off events. [2022-12-05 20:22:08,943 INFO L131 PetriNetUnfolder]: For 132059/135391 co-relation queries the response was YES. [2022-12-05 20:22:08,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89147 conditions, 14124 events. 8858/14124 cut-off events. For 132059/135391 co-relation queries the response was YES. Maximal size of possible extension queue 1030. Compared 104820 event pairs, 550 based on Foata normal form. 1337/14957 useless extension candidates. Maximal degree in co-relation 89091. Up to 6267 conditions per place. [2022-12-05 20:22:09,014 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 171 selfloop transitions, 30 changer transitions 134/357 dead transitions. [2022-12-05 20:22:09,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 357 transitions, 5323 flow [2022-12-05 20:22:09,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-05 20:22:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-05 20:22:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2022-12-05 20:22:09,016 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46005509641873277 [2022-12-05 20:22:09,016 INFO L175 Difference]: Start difference. First operand has 116 places, 122 transitions, 1545 flow. Second operand 11 states and 167 transitions. [2022-12-05 20:22:09,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 357 transitions, 5323 flow [2022-12-05 20:22:11,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 357 transitions, 5159 flow, removed 53 selfloop flow, removed 6 redundant places. [2022-12-05 20:22:11,113 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 1164 flow [2022-12-05 20:22:11,113 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1164, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2022-12-05 20:22:11,114 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2022-12-05 20:22:11,114 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 1164 flow [2022-12-05 20:22:11,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:22:11,114 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:11,114 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:11,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-05 20:22:11,115 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -629679081, now seen corresponding path program 1 times [2022-12-05 20:22:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:11,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698987574] [2022-12-05 20:22:11,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:11,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:11,385 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:22:11,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:11,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698987574] [2022-12-05 20:22:11,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698987574] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:11,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:11,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:11,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729169843] [2022-12-05 20:22:11,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:11,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:11,388 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:11,388 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 1164 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:22:11,388 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:11,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:11,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:12,352 INFO L130 PetriNetUnfolder]: 5301/8766 cut-off events. [2022-12-05 20:22:12,352 INFO L131 PetriNetUnfolder]: For 62403/63351 co-relation queries the response was YES. [2022-12-05 20:22:12,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54346 conditions, 8766 events. 5301/8766 cut-off events. For 62403/63351 co-relation queries the response was YES. Maximal size of possible extension queue 578. Compared 61222 event pairs, 1131 based on Foata normal form. 164/8643 useless extension candidates. Maximal degree in co-relation 54298. Up to 4727 conditions per place. [2022-12-05 20:22:12,395 INFO L137 encePairwiseOnDemand]: 30/33 looper letters, 49 selfloop transitions, 1 changer transitions 122/178 dead transitions. [2022-12-05 20:22:12,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 178 transitions, 2364 flow [2022-12-05 20:22:12,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:12,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-05 20:22:12,396 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2022-12-05 20:22:12,396 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 1164 flow. Second operand 4 states and 65 transitions. [2022-12-05 20:22:12,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 178 transitions, 2364 flow [2022-12-05 20:22:12,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 178 transitions, 2007 flow, removed 67 selfloop flow, removed 21 redundant places. [2022-12-05 20:22:12,846 INFO L231 Difference]: Finished difference. Result has 104 places, 52 transitions, 474 flow [2022-12-05 20:22:12,846 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=975, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=474, PETRI_PLACES=104, PETRI_TRANSITIONS=52} [2022-12-05 20:22:12,847 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2022-12-05 20:22:12,847 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 52 transitions, 474 flow [2022-12-05 20:22:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:22:12,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:12,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:12,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-05 20:22:12,847 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:12,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 234020113, now seen corresponding path program 2 times [2022-12-05 20:22:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:12,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034775714] [2022-12-05 20:22:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:13,377 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:22:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:13,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034775714] [2022-12-05 20:22:13,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034775714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:13,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:13,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-05 20:22:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451017264] [2022-12-05 20:22:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:13,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-05 20:22:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:13,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-05 20:22:13,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-05 20:22:13,379 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2022-12-05 20:22:13,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 52 transitions, 474 flow. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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:22:13,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:13,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2022-12-05 20:22:13,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:13,643 INFO L130 PetriNetUnfolder]: 366/661 cut-off events. [2022-12-05 20:22:13,643 INFO L131 PetriNetUnfolder]: For 2737/2747 co-relation queries the response was YES. [2022-12-05 20:22:13,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 661 events. 366/661 cut-off events. For 2737/2747 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2687 event pairs, 48 based on Foata normal form. 7/664 useless extension candidates. Maximal degree in co-relation 3232. Up to 375 conditions per place. [2022-12-05 20:22:13,646 INFO L137 encePairwiseOnDemand]: 27/33 looper letters, 58 selfloop transitions, 9 changer transitions 22/94 dead transitions. [2022-12-05 20:22:13,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 913 flow [2022-12-05 20:22:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:13,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-05 20:22:13,647 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3434343434343434 [2022-12-05 20:22:13,647 INFO L175 Difference]: Start difference. First operand has 104 places, 52 transitions, 474 flow. Second operand 6 states and 68 transitions. [2022-12-05 20:22:13,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 913 flow [2022-12-05 20:22:13,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 94 transitions, 773 flow, removed 37 selfloop flow, removed 23 redundant places. [2022-12-05 20:22:13,654 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 362 flow [2022-12-05 20:22:13,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2022-12-05 20:22:13,654 INFO L294 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2022-12-05 20:22:13,654 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 362 flow [2022-12-05 20:22:13,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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:22:13,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:13,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:13,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-05 20:22:13,655 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:22:13,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 453039993, now seen corresponding path program 3 times [2022-12-05 20:22:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:13,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747839493] [2022-12-05 20:22:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:13,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:13,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:22:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:13,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:22:13,752 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:22:13,753 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 20:22:13,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-05 20:22:13,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 20:22:13,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 20:22:13,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 20:22:13,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 20:22:13,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-05 20:22:13,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-05 20:22:13,758 INFO L458 BasicCegarLoop]: Path program histogram: [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:13,762 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:22:13,763 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:22:13,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:22:13 BasicIcfg [2022-12-05 20:22:13,839 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:22:13,840 INFO L158 Benchmark]: Toolchain (without parser) took 68642.95ms. Allocated memory was 195.0MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 170.1MB in the beginning and 4.1GB in the end (delta: -3.9GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-05 20:22:13,840 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:13,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.30ms. Allocated memory is still 195.0MB. Free memory was 169.6MB in the beginning and 141.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-05 20:22:13,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.57ms. Allocated memory is still 195.0MB. Free memory was 141.8MB in the beginning and 138.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:13,840 INFO L158 Benchmark]: Boogie Preprocessor took 35.23ms. Allocated memory is still 195.0MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:22:13,840 INFO L158 Benchmark]: RCFGBuilder took 546.66ms. Allocated memory is still 195.0MB. Free memory was 136.5MB in the beginning and 101.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-05 20:22:13,841 INFO L158 Benchmark]: TraceAbstraction took 67561.28ms. Allocated memory was 195.0MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 100.9MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2022-12-05 20:22:13,841 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.13ms. Allocated memory is still 195.0MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.30ms. Allocated memory is still 195.0MB. Free memory was 169.6MB in the beginning and 141.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.57ms. Allocated memory is still 195.0MB. Free memory was 141.8MB in the beginning and 138.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.23ms. Allocated memory is still 195.0MB. Free memory was 138.6MB in the beginning and 136.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.66ms. Allocated memory is still 195.0MB. Free memory was 136.5MB in the beginning and 101.4MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 67561.28ms. Allocated memory was 195.0MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 100.9MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 136 PlacesBefore, 45 PlacesAfterwards, 125 TransitionsBefore, 33 TransitionsAfterwards, 2986 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 2084, independent unconditional: 0, dependent: 72, dependent conditional: 72, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2156, independent: 2084, independent conditional: 0, independent unconditional: 2084, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1869, independent: 1822, independent conditional: 0, independent unconditional: 1822, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1869, independent: 1794, independent conditional: 0, independent unconditional: 1794, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 195, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2156, independent: 262, independent conditional: 0, independent unconditional: 262, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 1869, unknown conditional: 0, unknown unconditional: 1869] , Statistics on independence cache: Total cache size (in pairs): 2641, Positive cache size: 2594, Positive conditional cache size: 0, Positive unconditional cache size: 2594, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t577; [L847] FCALL, FORK 0 pthread_create(&t577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t577, ((void *)0), P0, ((void *)0))=-4, t577={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t578; [L849] FCALL, FORK 0 pthread_create(&t578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t578, ((void *)0), P1, ((void *)0))=-3, t577={5:0}, t578={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t579; [L851] FCALL, FORK 0 pthread_create(&t579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t579, ((void *)0), P2, ((void *)0))=-2, t577={5:0}, t578={6:0}, t579={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] 0 pthread_t t580; [L853] FCALL, FORK 0 pthread_create(&t580, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t580, ((void *)0), P3, ((void *)0))=-1, t577={5:0}, t578={6:0}, t579={7:0}, t580={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L798] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=0] [L815] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L771] 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) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t577={5:0}, t578={6:0}, t579={7:0}, t580={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 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) [L871] 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)) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 67.4s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 54.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1091 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1091 mSDsluCounter, 98 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2511 IncrementalHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 48 mSDtfsCounter, 2511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2759occurred in iteration=17, InterpolantAutomatonStates: 134, 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.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 416 NumberOfCodeBlocks, 416 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 4018 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:22:13,876 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...