/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:06:52,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:06:52,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:06:52,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:06:52,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:06:52,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:06:52,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:06:52,493 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:06:52,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:06:52,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:06:52,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:06:52,501 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:06:52,501 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:06:52,503 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:06:52,504 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:06:52,505 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:06:52,508 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:06:52,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:06:52,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:06:52,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:06:52,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:06:52,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:06:52,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:06:52,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:06:52,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:06:52,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:06:52,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:06:52,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:06:52,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:06:52,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:06:52,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:06:52,533 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:06:52,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:06:52,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:06:52,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:06:52,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:06:52,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:06:52,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:06:52,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:06:52,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:06:52,538 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:06:52,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:06:52,580 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:06:52,580 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:06:52,583 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:06:52,583 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:06:52,583 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:06:52,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:06:52,584 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:06:52,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:06:52,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:06:52,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:06:52,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:06:52,585 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:06:52,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:06:52,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:06:52,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:06:52,587 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:06:52,587 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:06:52,587 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:06:52,587 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true 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 [2021-03-26 10:06:52,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:06:52,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:06:52,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:06:52,930 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:06:52,931 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:06:52,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-03-26 10:06:52,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0879ad84e/e7db307f826b49aab6ded4f9b391c309/FLAG660435815 [2021-03-26 10:06:53,735 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:06:53,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i [2021-03-26 10:06:53,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0879ad84e/e7db307f826b49aab6ded4f9b391c309/FLAG660435815 [2021-03-26 10:06:54,006 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0879ad84e/e7db307f826b49aab6ded4f9b391c309 [2021-03-26 10:06:54,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:06:54,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:06:54,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:06:54,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:06:54,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:06:54,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d55733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54, skipping insertion in model container [2021-03-26 10:06:54,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:06:54,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:06:54,218 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-03-26 10:06:54,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:06:54,410 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:06:54,419 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix037_tso.oepc.i[949,962] [2021-03-26 10:06:54,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:06:54,505 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:06:54,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54 WrapperNode [2021-03-26 10:06:54,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:06:54,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:06:54,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:06:54,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:06:54,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:06:54,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:06:54,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:06:54,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:06:54,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... [2021-03-26 10:06:54,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:06:54,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:06:54,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:06:54,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:06:54,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:06:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:06:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:06:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:06:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:06:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:06:54,667 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:06:54,667 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:06:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:06:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:06:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:06:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:06:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:06:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:06:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:06:54,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:06:54,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:06:54,670 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:06:56,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:06:56,685 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:06:56,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:06:56 BoogieIcfgContainer [2021-03-26 10:06:56,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:06:56,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:06:56,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:06:56,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:06:56,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:06:54" (1/3) ... [2021-03-26 10:06:56,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a26549d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:06:56, skipping insertion in model container [2021-03-26 10:06:56,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:06:54" (2/3) ... [2021-03-26 10:06:56,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a26549d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:06:56, skipping insertion in model container [2021-03-26 10:06:56,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:06:56" (3/3) ... [2021-03-26 10:06:56,693 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2021-03-26 10:06:56,699 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:06:56,703 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:06:56,703 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:06:56,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,745 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,749 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,750 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,756 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,757 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,758 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,759 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,760 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,761 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,762 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,765 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,766 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,766 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,766 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,767 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,768 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,769 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:06:56,771 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:06:56,786 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:06:56,803 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:06:56,804 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:06:56,804 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:06:56,804 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:06:56,804 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:06:56,804 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:06:56,804 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:06:56,804 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:06:56,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:06:56,853 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:06:56,853 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:06:56,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:06:56,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 120 transitions, 260 flow [2021-03-26 10:06:56,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 116 transitions, 244 flow [2021-03-26 10:06:56,863 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:06:56,874 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:06:56,877 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 244 flow [2021-03-26 10:06:56,879 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 244 flow [2021-03-26 10:06:56,898 INFO L129 PetriNetUnfolder]: 2/116 cut-off events. [2021-03-26 10:06:56,898 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:06:56,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 2/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-03-26 10:06:56,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 2868 [2021-03-26 10:06:59,050 WARN L205 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-26 10:06:59,336 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:07:00,759 WARN L205 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-26 10:07:01,371 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:07:01,812 WARN L205 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:07:02,219 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:07:02,330 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:07:03,708 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:07:03,998 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:07:04,634 WARN L205 SmtUtils]: Spent 633.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:07:05,253 WARN L205 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-26 10:07:05,823 INFO L154 LiptonReduction]: Checked pairs total: 5149 [2021-03-26 10:07:05,823 INFO L156 LiptonReduction]: Total number of compositions: 77 [2021-03-26 10:07:05,825 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8963 [2021-03-26 10:07:05,834 INFO L129 PetriNetUnfolder]: 0/17 cut-off events. [2021-03-26 10:07:05,834 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:05,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:05,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:05,835 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:05,839 INFO L82 PathProgramCache]: Analyzing trace with hash 557082090, now seen corresponding path program 1 times [2021-03-26 10:07:05,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:05,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595774330] [2021-03-26 10:07:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:06,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:06,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:06,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:06,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:06,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595774330] [2021-03-26 10:07:06,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:06,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:07:06,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129894624] [2021-03-26 10:07:06,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:07:06,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:07:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:07:06,120 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 197 [2021-03-26 10:07:06,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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) [2021-03-26 10:07:06,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:06,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 197 [2021-03-26 10:07:06,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:06,301 INFO L129 PetriNetUnfolder]: 185/411 cut-off events. [2021-03-26 10:07:06,301 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:06,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 411 events. 185/411 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2203 event pairs, 123 based on Foata normal form. 20/392 useless extension candidates. Maximal degree in co-relation 685. Up to 209 conditions per place. [2021-03-26 10:07:06,310 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 11 selfloop transitions, 2 changer transitions 4/49 dead transitions. [2021-03-26 10:07:06,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 49 transitions, 140 flow [2021-03-26 10:07:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2021-03-26 10:07:06,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9086294416243654 [2021-03-26 10:07:06,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 537 transitions. [2021-03-26 10:07:06,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 537 transitions. [2021-03-26 10:07:06,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:06,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 537 transitions. [2021-03-26 10:07:06,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.0) internal successors, (537), 3 states have internal predecessors, (537), 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) [2021-03-26 10:07:06,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2021-03-26 10:07:06,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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) [2021-03-26 10:07:06,361 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 537 transitions. [2021-03-26 10:07:06,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 49 transitions, 140 flow [2021-03-26 10:07:06,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 136 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:06,368 INFO L241 Difference]: Finished difference. Result has 54 places, 40 transitions, 92 flow [2021-03-26 10:07:06,370 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2021-03-26 10:07:06,371 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -4 predicate places. [2021-03-26 10:07:06,371 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:06,371 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 40 transitions, 92 flow [2021-03-26 10:07:06,372 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 40 transitions, 92 flow [2021-03-26 10:07:06,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 92 flow [2021-03-26 10:07:06,378 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-03-26 10:07:06,378 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:06,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 40 events. 0/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:07:06,381 INFO L142 LiptonReduction]: Number of co-enabled transitions 482 [2021-03-26 10:07:06,749 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 10:07:07,079 WARN L205 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-26 10:07:07,796 WARN L205 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 10:07:08,418 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-26 10:07:08,748 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:07:08,885 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:07:10,340 INFO L154 LiptonReduction]: Checked pairs total: 2033 [2021-03-26 10:07:10,340 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-26 10:07:10,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3970 [2021-03-26 10:07:10,342 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-03-26 10:07:10,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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) [2021-03-26 10:07:10,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:10,342 INFO L263 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] [2021-03-26 10:07:10,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:07:10,343 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1270069717, now seen corresponding path program 1 times [2021-03-26 10:07:10,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:10,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40087574] [2021-03-26 10:07:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:10,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:10,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:10,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:10,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:10,446 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:07:10,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:07:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:10,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40087574] [2021-03-26 10:07:10,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:10,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:10,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061449472] [2021-03-26 10:07:10,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:10,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:10,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:10,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 209 [2021-03-26 10:07:10,456 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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) [2021-03-26 10:07:10,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:10,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 209 [2021-03-26 10:07:10,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:10,473 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:07:10,473 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:10,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:07:10,474 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 1 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-26 10:07:10,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 28 transitions, 74 flow [2021-03-26 10:07:10,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:10,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-03-26 10:07:10,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8963317384370016 [2021-03-26 10:07:10,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-03-26 10:07:10,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-03-26 10:07:10,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:10,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-03-26 10:07:10,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 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) [2021-03-26 10:07:10,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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) [2021-03-26 10:07:10,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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) [2021-03-26 10:07:10,481 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 3 states and 562 transitions. [2021-03-26 10:07:10,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 28 transitions, 74 flow [2021-03-26 10:07:10,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:10,482 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 72 flow [2021-03-26 10:07:10,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2021-03-26 10:07:10,483 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2021-03-26 10:07:10,483 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:10,483 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 72 flow [2021-03-26 10:07:10,484 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 72 flow [2021-03-26 10:07:10,484 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 72 flow [2021-03-26 10:07:10,488 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-03-26 10:07:10,488 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:07:10,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:07:10,489 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-26 10:07:10,917 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:07:11,090 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:07:11,456 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-03-26 10:07:11,626 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-03-26 10:07:11,631 INFO L154 LiptonReduction]: Checked pairs total: 930 [2021-03-26 10:07:11,631 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:11,631 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1148 [2021-03-26 10:07:11,632 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2021-03-26 10:07:11,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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) [2021-03-26 10:07:11,633 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:11,633 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:11,633 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:07:11,633 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:11,633 INFO L82 PathProgramCache]: Analyzing trace with hash -2067803017, now seen corresponding path program 1 times [2021-03-26 10:07:11,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:11,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342738467] [2021-03-26 10:07:11,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:11,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:11,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:11,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:11,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:11,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:11,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:07:11,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:11,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342738467] [2021-03-26 10:07:11,767 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:11,767 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:11,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575142792] [2021-03-26 10:07:11,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:11,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:11,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:11,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:11,769 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 210 [2021-03-26 10:07:11,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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) [2021-03-26 10:07:11,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:11,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 210 [2021-03-26 10:07:11,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:11,871 INFO L129 PetriNetUnfolder]: 213/379 cut-off events. [2021-03-26 10:07:11,872 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 10:07:11,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 749 conditions, 379 events. 213/379 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1837 event pairs, 155 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 739. Up to 319 conditions per place. [2021-03-26 10:07:11,875 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 9 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2021-03-26 10:07:11,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 32 transitions, 108 flow [2021-03-26 10:07:11,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:07:11,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:07:11,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2021-03-26 10:07:11,877 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2021-03-26 10:07:11,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2021-03-26 10:07:11,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2021-03-26 10:07:11,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:11,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2021-03-26 10:07:11,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 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) [2021-03-26 10:07:11,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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) [2021-03-26 10:07:11,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 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) [2021-03-26 10:07:11,881 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 531 transitions. [2021-03-26 10:07:11,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 32 transitions, 108 flow [2021-03-26 10:07:11,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:11,883 INFO L241 Difference]: Finished difference. Result has 40 places, 31 transitions, 99 flow [2021-03-26 10:07:11,883 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2021-03-26 10:07:11,884 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -18 predicate places. [2021-03-26 10:07:11,884 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:11,884 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 99 flow [2021-03-26 10:07:11,885 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 99 flow [2021-03-26 10:07:11,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 99 flow [2021-03-26 10:07:11,899 INFO L129 PetriNetUnfolder]: 45/129 cut-off events. [2021-03-26 10:07:11,899 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2021-03-26 10:07:11,899 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 129 events. 45/129 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 540 event pairs, 23 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 228. Up to 76 conditions per place. [2021-03-26 10:07:11,901 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:07:11,904 INFO L154 LiptonReduction]: Checked pairs total: 326 [2021-03-26 10:07:11,905 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:11,905 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:07:11,907 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 99 flow [2021-03-26 10:07:11,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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) [2021-03-26 10:07:11,908 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:11,908 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:11,908 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:07:11,908 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash 356879023, now seen corresponding path program 1 times [2021-03-26 10:07:11,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:11,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435816614] [2021-03-26 10:07:11,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:12,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:12,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:07:12,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 10:07:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:12,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435816614] [2021-03-26 10:07:12,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:12,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:12,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701876294] [2021-03-26 10:07:12,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:12,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:12,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:12,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:12,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-26 10:07:12,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:12,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:12,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-26 10:07:12,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:12,192 INFO L129 PetriNetUnfolder]: 223/393 cut-off events. [2021-03-26 10:07:12,192 INFO L130 PetriNetUnfolder]: For 124/250 co-relation queries the response was YES. [2021-03-26 10:07:12,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 393 events. 223/393 cut-off events. For 124/250 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1854 event pairs, 146 based on Foata normal form. 12/387 useless extension candidates. Maximal degree in co-relation 991. Up to 328 conditions per place. [2021-03-26 10:07:12,196 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 14 selfloop transitions, 14 changer transitions 0/46 dead transitions. [2021-03-26 10:07:12,196 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 46 transitions, 207 flow [2021-03-26 10:07:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2021-03-26 10:07:12,199 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8247619047619048 [2021-03-26 10:07:12,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2021-03-26 10:07:12,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2021-03-26 10:07:12,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:12,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2021-03-26 10:07:12,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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) [2021-03-26 10:07:12,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:12,204 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:12,204 INFO L185 Difference]: Start difference. First operand has 40 places, 31 transitions, 99 flow. Second operand 5 states and 866 transitions. [2021-03-26 10:07:12,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 46 transitions, 207 flow [2021-03-26 10:07:12,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:12,207 INFO L241 Difference]: Finished difference. Result has 46 places, 44 transitions, 206 flow [2021-03-26 10:07:12,208 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2021-03-26 10:07:12,208 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -12 predicate places. [2021-03-26 10:07:12,208 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:12,208 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 44 transitions, 206 flow [2021-03-26 10:07:12,208 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 44 transitions, 206 flow [2021-03-26 10:07:12,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 44 transitions, 206 flow [2021-03-26 10:07:12,249 INFO L129 PetriNetUnfolder]: 135/312 cut-off events. [2021-03-26 10:07:12,249 INFO L130 PetriNetUnfolder]: For 355/407 co-relation queries the response was YES. [2021-03-26 10:07:12,251 INFO L84 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 312 events. 135/312 cut-off events. For 355/407 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1690 event pairs, 46 based on Foata normal form. 2/284 useless extension candidates. Maximal degree in co-relation 822. Up to 194 conditions per place. [2021-03-26 10:07:12,254 INFO L142 LiptonReduction]: Number of co-enabled transitions 592 [2021-03-26 10:07:12,302 INFO L154 LiptonReduction]: Checked pairs total: 522 [2021-03-26 10:07:12,303 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:12,303 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 95 [2021-03-26 10:07:12,307 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 206 flow [2021-03-26 10:07:12,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:12,308 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:12,308 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:12,308 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:07:12,308 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:12,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 327063223, now seen corresponding path program 2 times [2021-03-26 10:07:12,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:12,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185076004] [2021-03-26 10:07:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:12,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:12,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:12,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:12,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185076004] [2021-03-26 10:07:12,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:12,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:12,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939054787] [2021-03-26 10:07:12,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:12,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:12,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:12,464 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-26 10:07:12,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:12,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:12,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-26 10:07:12,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:12,585 INFO L129 PetriNetUnfolder]: 224/403 cut-off events. [2021-03-26 10:07:12,585 INFO L130 PetriNetUnfolder]: For 612/949 co-relation queries the response was YES. [2021-03-26 10:07:12,586 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 403 events. 224/403 cut-off events. For 612/949 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1964 event pairs, 145 based on Foata normal form. 33/419 useless extension candidates. Maximal degree in co-relation 1344. Up to 312 conditions per place. [2021-03-26 10:07:12,589 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 21 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2021-03-26 10:07:12,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 330 flow [2021-03-26 10:07:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2021-03-26 10:07:12,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.825 [2021-03-26 10:07:12,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2021-03-26 10:07:12,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2021-03-26 10:07:12,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:12,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2021-03-26 10:07:12,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 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) [2021-03-26 10:07:12,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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) [2021-03-26 10:07:12,595 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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) [2021-03-26 10:07:12,595 INFO L185 Difference]: Start difference. First operand has 46 places, 44 transitions, 206 flow. Second operand 4 states and 693 transitions. [2021-03-26 10:07:12,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 330 flow [2021-03-26 10:07:12,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 54 transitions, 320 flow, removed 5 selfloop flow, removed 0 redundant places. [2021-03-26 10:07:12,600 INFO L241 Difference]: Finished difference. Result has 51 places, 50 transitions, 290 flow [2021-03-26 10:07:12,600 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2021-03-26 10:07:12,600 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -7 predicate places. [2021-03-26 10:07:12,600 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:12,601 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 50 transitions, 290 flow [2021-03-26 10:07:12,601 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 50 transitions, 290 flow [2021-03-26 10:07:12,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 290 flow [2021-03-26 10:07:12,644 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1184] L876-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~x$w_buff1_used~0_562 256) 0)) (.cse14 (= (mod v_~x$r_buff0_thd0~0_326 256) 0)) (.cse19 (= (mod v_~x$r_buff1_thd0~0_261 256) 0))) (let ((.cse10 (and .cse14 .cse19)) (.cse12 (and .cse14 .cse18)) (.cse17 (= (mod v_~x$w_buff0_used~0_726 256) 0)) (.cse15 (not .cse14)) (.cse0 (= (mod v_~weak$$choice2~0_112 256) 0))) (let ((.cse2 (not .cse0)) (.cse5 (or (not .cse19) .cse15)) (.cse6 (or (not .cse18) .cse15)) (.cse7 (not .cse17)) (.cse4 (or .cse10 .cse17 .cse12))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite58_144| |v_ULTIMATE.start_main_#t~ite58_143|))) (or (and .cse0 (= v_~x$r_buff1_thd0~0_261 |v_ULTIMATE.start_main_#t~ite59_140|) .cse1 (= v_~x$r_buff1_thd0~0_260 |v_ULTIMATE.start_main_#t~ite59_140|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite59_140| |v_ULTIMATE.start_main_#t~ite59_139|) .cse1 (= v_~x$r_buff1_thd0~0_261 v_~x$r_buff1_thd0~0_260)))) (= v_~x$flush_delayed~0_72 0) (let ((.cse3 (= |v_ULTIMATE.start_main_#t~ite43_144| |v_ULTIMATE.start_main_#t~ite43_143|))) (or (and .cse2 .cse3 (= |v_ULTIMATE.start_main_#t~ite44_138| |v_ULTIMATE.start_main_#t~ite44_137|) (= v_~x$w_buff0~0_254 v_~x$w_buff0~0_253)) (and .cse0 (or (and (= v_~x$w_buff0~0_254 |v_ULTIMATE.start_main_#t~ite44_138|) .cse3 .cse4) (and .cse5 .cse6 .cse7 (= |v_ULTIMATE.start_main_#t~ite43_144| |v_ULTIMATE.start_main_#t~ite44_138|) (= v_~x$w_buff0~0_254 |v_ULTIMATE.start_main_#t~ite43_144|))) (= v_~x$w_buff0~0_253 |v_ULTIMATE.start_main_#t~ite44_138|)))) (= |v_ULTIMATE.start_main_#t~nondet39_73| v_~weak$$choice0~0_41) (= (mod v_~main$tmp_guard1~0_48 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_23|) (= v_~main$tmp_guard1~0_48 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_55 0) (= 0 v_~__unbuffered_p3_EBX~0_58) (= 2 |v_ULTIMATE.start_main_#t~ite42_97|) (= v_~__unbuffered_p2_EAX~0_57 0) (= v_~__unbuffered_p3_EAX~0_52 1))) 1 0) 0) 0 1)) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite55_158| |v_ULTIMATE.start_main_#t~ite55_157|))) (or (and .cse0 (= v_~x$r_buff0_thd0~0_325 |v_ULTIMATE.start_main_#t~ite56_152|) .cse8 (= v_~x$r_buff0_thd0~0_326 |v_ULTIMATE.start_main_#t~ite56_152|)) (and .cse2 .cse8 (= v_~x$r_buff0_thd0~0_326 v_~x$r_buff0_thd0~0_325) (= |v_ULTIMATE.start_main_#t~ite56_152| |v_ULTIMATE.start_main_#t~ite56_151|)))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_23|) (= v_~x$mem_tmp~0_52 v_~x~0_388) (or (and .cse0 (= |v_ULTIMATE.start_main_#t~ite42_97| v_~x~0_387)) (and (= v_~x$mem_tmp~0_52 v_~x~0_387) .cse2)) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite46_144| |v_ULTIMATE.start_main_#t~ite46_143|))) (or (and .cse0 (or (and .cse9 .cse4 (= |v_ULTIMATE.start_main_#t~ite47_134| v_~x$w_buff1~0_251)) (and .cse5 .cse6 .cse7 (= |v_ULTIMATE.start_main_#t~ite46_144| v_~x$w_buff1~0_251) (= |v_ULTIMATE.start_main_#t~ite46_144| |v_ULTIMATE.start_main_#t~ite47_134|))) (= |v_ULTIMATE.start_main_#t~ite47_134| v_~x$w_buff1~0_250)) (and .cse9 .cse2 (= |v_ULTIMATE.start_main_#t~ite47_134| |v_ULTIMATE.start_main_#t~ite47_133|) (= v_~x$w_buff1~0_251 v_~x$w_buff1~0_250)))) (let ((.cse13 (= |v_ULTIMATE.start_main_#t~ite52_138| |v_ULTIMATE.start_main_#t~ite52_137|))) (or (and .cse0 (= v_~x$w_buff1_used~0_561 |v_ULTIMATE.start_main_#t~ite53_130|) (let ((.cse11 (= (mod v_~x$w_buff0_used~0_725 256) 0))) (or (and (or .cse10 .cse11 .cse12) .cse13 (= v_~x$w_buff1_used~0_562 |v_ULTIMATE.start_main_#t~ite53_130|)) (and .cse5 .cse6 (not .cse11) (= |v_ULTIMATE.start_main_#t~ite52_138| 0) (= |v_ULTIMATE.start_main_#t~ite52_138| |v_ULTIMATE.start_main_#t~ite53_130|))))) (and .cse2 .cse13 (= |v_ULTIMATE.start_main_#t~ite53_129| |v_ULTIMATE.start_main_#t~ite53_130|) (= v_~x$w_buff1_used~0_562 v_~x$w_buff1_used~0_561)))) (= v_~weak$$choice2~0_112 |v_ULTIMATE.start_main_#t~nondet40_79|) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite49_148| |v_ULTIMATE.start_main_#t~ite49_147|))) (or (and .cse0 (or (and .cse5 .cse6 .cse7 (or (and (= v_~x$w_buff0_used~0_726 |v_ULTIMATE.start_main_#t~ite49_148|) .cse14) (and (= |v_ULTIMATE.start_main_#t~ite49_148| 0) .cse15)) (= |v_ULTIMATE.start_main_#t~ite49_148| |v_ULTIMATE.start_main_#t~ite50_140|)) (and .cse16 (= v_~x$w_buff0_used~0_726 |v_ULTIMATE.start_main_#t~ite50_140|) .cse4)) (= v_~x$w_buff0_used~0_725 |v_ULTIMATE.start_main_#t~ite50_140|)) (and .cse2 (= |v_ULTIMATE.start_main_#t~ite50_140| |v_ULTIMATE.start_main_#t~ite50_139|) .cse16 (= v_~x$w_buff0_used~0_726 v_~x$w_buff0_used~0_725)))) (or (and .cse5 .cse6 .cse7 (= |v_ULTIMATE.start_main_#t~ite42_97| |v_ULTIMATE.start_main_#t~ite41_116|) (or (and .cse14 (= |v_ULTIMATE.start_main_#t~ite41_116| v_~x$w_buff1~0_251)) (and .cse15 (= v_~x$w_buff0~0_254 |v_ULTIMATE.start_main_#t~ite41_116|)))) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite41_116| |v_ULTIMATE.start_main_#t~ite41_115|) (= |v_ULTIMATE.start_main_#t~ite42_97| v_~x~0_388))))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_254, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_143|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_147|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_143|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_137|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_139|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_137|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_57, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_326, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_79|, ~x$w_buff1~0=v_~x$w_buff1~0_251, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_143|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_562, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_139|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_261, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_129|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_151|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_726, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_157|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_115|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_73|, ~x~0=v_~x~0_388} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_253, ~x$flush_delayed~0=v_~x$flush_delayed~0_72, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_132|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_142|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_146|, ~x$mem_tmp~0=v_~x$mem_tmp~0_52, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_70|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_142|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_96|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_64|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_136|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_138|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_136|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_70|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_52, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_57, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_23|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_325, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_78|, ~x$w_buff1~0=v_~x$w_buff1~0_250, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_142|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_561, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_66|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_138|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_260, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_128|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_150|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_725, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_156|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_66|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_114|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_64|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_72|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~x~0=v_~x~0_387} AuxVars[|v_ULTIMATE.start_main_#t~ite53_130|, |v_ULTIMATE.start_main_#t~ite55_158|, |v_ULTIMATE.start_main_#t~ite42_97|, |v_ULTIMATE.start_main_#t~ite52_138|, |v_ULTIMATE.start_main_#t~ite44_138|, |v_ULTIMATE.start_main_#t~ite46_144|, |v_ULTIMATE.start_main_#t~ite59_140|, |v_ULTIMATE.start_main_#t~ite47_134|, |v_ULTIMATE.start_main_#t~ite49_148|, |v_ULTIMATE.start_main_#t~ite50_140|, |v_ULTIMATE.start_main_#t~ite43_144|, |v_ULTIMATE.start_main_#t~ite41_116|, |v_ULTIMATE.start_main_#t~ite56_152|, |v_ULTIMATE.start_main_#t~ite58_144|] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ULTIMATE.start___VERIFIER_assert_#in~expression, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite56, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite55, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0][21], [160#true, P3Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 99#L841true, P2Thread1of1ForFork0InUse, 36#L765true, Black: 162#(and (= ~x$w_buff1~0 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0)), P0Thread1of1ForFork2InUse, Black: 164#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 141#(= ~__unbuffered_p3_EAX~0 0), 54#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 147#(and (= ~x~0 0) (= ~x$w_buff0_used~0 0) (= ~x$r_buff1_thd0~0 0)), 151#true, 24#L795true, 57#P2ENTRYtrue, Black: 153#(and (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$w_buff0~0) (= ~x~0 ~x$w_buff0~0)), Black: 154#(and (not (= ~x$w_buff1~0 ~x$w_buff0~0)) (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 155#(and (= 2 ~x$w_buff0~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (not (= ~x~0 ~x$w_buff0~0)))]) [2021-03-26 10:07:12,645 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-26 10:07:12,645 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:12,645 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:12,645 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-26 10:07:12,651 INFO L129 PetriNetUnfolder]: 150/333 cut-off events. [2021-03-26 10:07:12,651 INFO L130 PetriNetUnfolder]: For 1057/1233 co-relation queries the response was YES. [2021-03-26 10:07:12,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 333 events. 150/333 cut-off events. For 1057/1233 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1751 event pairs, 39 based on Foata normal form. 2/300 useless extension candidates. Maximal degree in co-relation 1214. Up to 191 conditions per place. [2021-03-26 10:07:12,656 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-26 10:07:12,687 INFO L154 LiptonReduction]: Checked pairs total: 780 [2021-03-26 10:07:12,688 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:12,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-03-26 10:07:12,689 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 290 flow [2021-03-26 10:07:12,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:12,691 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:12,691 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:12,691 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:07:12,691 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:12,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:12,691 INFO L82 PathProgramCache]: Analyzing trace with hash 847027991, now seen corresponding path program 1 times [2021-03-26 10:07:12,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:12,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432463954] [2021-03-26 10:07:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:12,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:12,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:12,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:12,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:07:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:12,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432463954] [2021-03-26 10:07:12,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:12,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:12,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281315792] [2021-03-26 10:07:12,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:12,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:12,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:12,799 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-03-26 10:07:12,799 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 290 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:12,799 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:12,799 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-03-26 10:07:12,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:12,914 INFO L129 PetriNetUnfolder]: 204/375 cut-off events. [2021-03-26 10:07:12,914 INFO L130 PetriNetUnfolder]: For 1064/1591 co-relation queries the response was YES. [2021-03-26 10:07:12,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 375 events. 204/375 cut-off events. For 1064/1591 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1765 event pairs, 91 based on Foata normal form. 40/400 useless extension candidates. Maximal degree in co-relation 1508. Up to 256 conditions per place. [2021-03-26 10:07:12,919 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 31 selfloop transitions, 8 changer transitions 0/57 dead transitions. [2021-03-26 10:07:12,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 412 flow [2021-03-26 10:07:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 691 transitions. [2021-03-26 10:07:12,922 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8226190476190476 [2021-03-26 10:07:12,922 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 691 transitions. [2021-03-26 10:07:12,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 691 transitions. [2021-03-26 10:07:12,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:12,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 691 transitions. [2021-03-26 10:07:12,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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) [2021-03-26 10:07:12,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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) [2021-03-26 10:07:12,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 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) [2021-03-26 10:07:12,925 INFO L185 Difference]: Start difference. First operand has 51 places, 50 transitions, 290 flow. Second operand 4 states and 691 transitions. [2021-03-26 10:07:12,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 412 flow [2021-03-26 10:07:12,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 404 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-03-26 10:07:12,930 INFO L241 Difference]: Finished difference. Result has 55 places, 50 transitions, 304 flow [2021-03-26 10:07:12,931 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2021-03-26 10:07:12,931 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-26 10:07:12,931 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:12,931 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 50 transitions, 304 flow [2021-03-26 10:07:12,931 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 50 transitions, 304 flow [2021-03-26 10:07:12,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 50 transitions, 304 flow [2021-03-26 10:07:12,971 INFO L129 PetriNetUnfolder]: 131/295 cut-off events. [2021-03-26 10:07:12,971 INFO L130 PetriNetUnfolder]: For 1070/1192 co-relation queries the response was YES. [2021-03-26 10:07:12,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 295 events. 131/295 cut-off events. For 1070/1192 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1478 event pairs, 30 based on Foata normal form. 3/274 useless extension candidates. Maximal degree in co-relation 1090. Up to 152 conditions per place. [2021-03-26 10:07:12,976 INFO L142 LiptonReduction]: Number of co-enabled transitions 702 [2021-03-26 10:07:13,037 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-26 10:07:13,037 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:13,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 106 [2021-03-26 10:07:13,038 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 304 flow [2021-03-26 10:07:13,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 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) [2021-03-26 10:07:13,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:13,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:13,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:07:13,039 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 291023832, now seen corresponding path program 1 times [2021-03-26 10:07:13,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:13,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575636154] [2021-03-26 10:07:13,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:13,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:07:13,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:13,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:07:13,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:07:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:13,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575636154] [2021-03-26 10:07:13,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:13,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:13,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28074912] [2021-03-26 10:07:13,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:13,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:13,171 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 210 [2021-03-26 10:07:13,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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) [2021-03-26 10:07:13,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:13,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 210 [2021-03-26 10:07:13,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:13,330 INFO L129 PetriNetUnfolder]: 236/439 cut-off events. [2021-03-26 10:07:13,330 INFO L130 PetriNetUnfolder]: For 1154/1616 co-relation queries the response was YES. [2021-03-26 10:07:13,332 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 439 events. 236/439 cut-off events. For 1154/1616 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2103 event pairs, 32 based on Foata normal form. 46/474 useless extension candidates. Maximal degree in co-relation 1768. Up to 274 conditions per place. [2021-03-26 10:07:13,335 INFO L132 encePairwiseOnDemand]: 201/210 looper letters, 29 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2021-03-26 10:07:13,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 483 flow [2021-03-26 10:07:13,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:13,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 850 transitions. [2021-03-26 10:07:13,339 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2021-03-26 10:07:13,339 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 850 transitions. [2021-03-26 10:07:13,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 850 transitions. [2021-03-26 10:07:13,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:13,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 850 transitions. [2021-03-26 10:07:13,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 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) [2021-03-26 10:07:13,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:13,342 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:13,343 INFO L185 Difference]: Start difference. First operand has 55 places, 50 transitions, 304 flow. Second operand 5 states and 850 transitions. [2021-03-26 10:07:13,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 483 flow [2021-03-26 10:07:13,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 466 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:13,348 INFO L241 Difference]: Finished difference. Result has 59 places, 59 transitions, 411 flow [2021-03-26 10:07:13,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=59, PETRI_TRANSITIONS=59} [2021-03-26 10:07:13,349 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 1 predicate places. [2021-03-26 10:07:13,349 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:13,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 59 transitions, 411 flow [2021-03-26 10:07:13,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 59 transitions, 411 flow [2021-03-26 10:07:13,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 59 transitions, 411 flow [2021-03-26 10:07:13,406 INFO L129 PetriNetUnfolder]: 221/423 cut-off events. [2021-03-26 10:07:13,406 INFO L130 PetriNetUnfolder]: For 2137/2473 co-relation queries the response was YES. [2021-03-26 10:07:13,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1899 conditions, 423 events. 221/423 cut-off events. For 2137/2473 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2156 event pairs, 29 based on Foata normal form. 5/391 useless extension candidates. Maximal degree in co-relation 1877. Up to 225 conditions per place. [2021-03-26 10:07:13,413 INFO L142 LiptonReduction]: Number of co-enabled transitions 842 [2021-03-26 10:07:13,466 INFO L154 LiptonReduction]: Checked pairs total: 1127 [2021-03-26 10:07:13,467 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:13,467 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 118 [2021-03-26 10:07:13,467 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 59 transitions, 411 flow [2021-03-26 10:07:13,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 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) [2021-03-26 10:07:13,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:13,468 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:13,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:07:13,468 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -202461128, now seen corresponding path program 2 times [2021-03-26 10:07:13,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:13,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910066037] [2021-03-26 10:07:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:13,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:13,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:07:13,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:13,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:07:13,563 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-26 10:07:13,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:07:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:13,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910066037] [2021-03-26 10:07:13,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:13,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:13,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182285531] [2021-03-26 10:07:13,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:13,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:13,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:13,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:13,588 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 210 [2021-03-26 10:07:13,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 59 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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) [2021-03-26 10:07:13,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:13,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 210 [2021-03-26 10:07:13,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:13,824 INFO L129 PetriNetUnfolder]: 257/468 cut-off events. [2021-03-26 10:07:13,824 INFO L130 PetriNetUnfolder]: For 2452/3557 co-relation queries the response was YES. [2021-03-26 10:07:13,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 468 events. 257/468 cut-off events. For 2452/3557 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2249 event pairs, 33 based on Foata normal form. 68/526 useless extension candidates. Maximal degree in co-relation 2342. Up to 264 conditions per place. [2021-03-26 10:07:13,830 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 26 selfloop transitions, 27 changer transitions 0/71 dead transitions. [2021-03-26 10:07:13,830 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 631 flow [2021-03-26 10:07:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 855 transitions. [2021-03-26 10:07:13,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8142857142857143 [2021-03-26 10:07:13,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 855 transitions. [2021-03-26 10:07:13,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 855 transitions. [2021-03-26 10:07:13,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:13,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 855 transitions. [2021-03-26 10:07:13,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 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) [2021-03-26 10:07:13,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:13,838 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 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) [2021-03-26 10:07:13,838 INFO L185 Difference]: Start difference. First operand has 59 places, 59 transitions, 411 flow. Second operand 5 states and 855 transitions. [2021-03-26 10:07:13,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 631 flow [2021-03-26 10:07:13,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 586 flow, removed 18 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:13,844 INFO L241 Difference]: Finished difference. Result has 63 places, 63 transitions, 493 flow [2021-03-26 10:07:13,844 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=493, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2021-03-26 10:07:13,844 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2021-03-26 10:07:13,845 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:13,845 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 63 transitions, 493 flow [2021-03-26 10:07:13,845 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 63 transitions, 493 flow [2021-03-26 10:07:13,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 63 transitions, 493 flow [2021-03-26 10:07:13,908 INFO L129 PetriNetUnfolder]: 244/468 cut-off events. [2021-03-26 10:07:13,908 INFO L130 PetriNetUnfolder]: For 3054/3500 co-relation queries the response was YES. [2021-03-26 10:07:13,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2308 conditions, 468 events. 244/468 cut-off events. For 3054/3500 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2354 event pairs, 45 based on Foata normal form. 11/442 useless extension candidates. Maximal degree in co-relation 2284. Up to 265 conditions per place. [2021-03-26 10:07:13,916 INFO L142 LiptonReduction]: Number of co-enabled transitions 914 [2021-03-26 10:07:14,169 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:07:14,635 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 10:07:14,776 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:07:14,838 INFO L154 LiptonReduction]: Checked pairs total: 2340 [2021-03-26 10:07:14,838 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:07:14,839 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 994 [2021-03-26 10:07:14,839 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 498 flow [2021-03-26 10:07:14,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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) [2021-03-26 10:07:14,840 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:14,840 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:14,840 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:07:14,840 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -234461558, now seen corresponding path program 1 times [2021-03-26 10:07:14,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:14,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539935733] [2021-03-26 10:07:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:14,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:14,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:14,885 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:07:14,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:14,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:14,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:14,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539935733] [2021-03-26 10:07:14,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:14,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:14,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682168001] [2021-03-26 10:07:14,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:14,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:14,895 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 10:07:14,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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) [2021-03-26 10:07:14,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:14,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 10:07:14,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:15,071 INFO L129 PetriNetUnfolder]: 596/1093 cut-off events. [2021-03-26 10:07:15,071 INFO L130 PetriNetUnfolder]: For 5614/6331 co-relation queries the response was YES. [2021-03-26 10:07:15,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4343 conditions, 1093 events. 596/1093 cut-off events. For 5614/6331 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 6968 event pairs, 247 based on Foata normal form. 166/1158 useless extension candidates. Maximal degree in co-relation 4317. Up to 500 conditions per place. [2021-03-26 10:07:15,089 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 11 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2021-03-26 10:07:15,089 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 519 flow [2021-03-26 10:07:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:07:15,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:07:15,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2021-03-26 10:07:15,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8691943127962085 [2021-03-26 10:07:15,092 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2021-03-26 10:07:15,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2021-03-26 10:07:15,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:15,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2021-03-26 10:07:15,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 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) [2021-03-26 10:07:15,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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) [2021-03-26 10:07:15,096 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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) [2021-03-26 10:07:15,096 INFO L185 Difference]: Start difference. First operand has 63 places, 63 transitions, 498 flow. Second operand 5 states and 917 transitions. [2021-03-26 10:07:15,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 519 flow [2021-03-26 10:07:15,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 71 transitions, 458 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:15,105 INFO L241 Difference]: Finished difference. Result has 66 places, 67 transitions, 469 flow [2021-03-26 10:07:15,105 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2021-03-26 10:07:15,105 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2021-03-26 10:07:15,105 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:15,106 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 67 transitions, 469 flow [2021-03-26 10:07:15,106 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 469 flow [2021-03-26 10:07:15,106 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 469 flow [2021-03-26 10:07:15,295 INFO L129 PetriNetUnfolder]: 588/1091 cut-off events. [2021-03-26 10:07:15,295 INFO L130 PetriNetUnfolder]: For 3234/3889 co-relation queries the response was YES. [2021-03-26 10:07:15,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4095 conditions, 1091 events. 588/1091 cut-off events. For 3234/3889 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 7076 event pairs, 226 based on Foata normal form. 30/997 useless extension candidates. Maximal degree in co-relation 4069. Up to 519 conditions per place. [2021-03-26 10:07:15,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 1154 [2021-03-26 10:07:15,359 INFO L154 LiptonReduction]: Checked pairs total: 864 [2021-03-26 10:07:15,359 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:15,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 255 [2021-03-26 10:07:15,360 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 469 flow [2021-03-26 10:07:15,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 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) [2021-03-26 10:07:15,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:15,361 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:15,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:07:15,361 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:15,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:15,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1499084466, now seen corresponding path program 1 times [2021-03-26 10:07:15,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:15,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360209559] [2021-03-26 10:07:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:15,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:15,442 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:15,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:15,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:15,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:15,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:07:15,487 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-03-26 10:07:15,489 INFO L147 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size 19 [2021-03-26 10:07:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:15,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360209559] [2021-03-26 10:07:15,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:15,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:15,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765101677] [2021-03-26 10:07:15,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:15,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:15,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:15,522 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 211 [2021-03-26 10:07:15,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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) [2021-03-26 10:07:15,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:15,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 211 [2021-03-26 10:07:15,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:15,869 INFO L129 PetriNetUnfolder]: 950/1690 cut-off events. [2021-03-26 10:07:15,869 INFO L130 PetriNetUnfolder]: For 6916/8704 co-relation queries the response was YES. [2021-03-26 10:07:15,880 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7242 conditions, 1690 events. 950/1690 cut-off events. For 6916/8704 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 11176 event pairs, 313 based on Foata normal form. 151/1678 useless extension candidates. Maximal degree in co-relation 7214. Up to 842 conditions per place. [2021-03-26 10:07:15,895 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 33 selfloop transitions, 23 changer transitions 0/83 dead transitions. [2021-03-26 10:07:15,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 733 flow [2021-03-26 10:07:15,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:07:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:07:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1022 transitions. [2021-03-26 10:07:15,898 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8072669826224329 [2021-03-26 10:07:15,898 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1022 transitions. [2021-03-26 10:07:15,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1022 transitions. [2021-03-26 10:07:15,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:15,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1022 transitions. [2021-03-26 10:07:15,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 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) [2021-03-26 10:07:15,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-03-26 10:07:15,904 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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) [2021-03-26 10:07:15,904 INFO L185 Difference]: Start difference. First operand has 66 places, 67 transitions, 469 flow. Second operand 6 states and 1022 transitions. [2021-03-26 10:07:15,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 733 flow [2021-03-26 10:07:15,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 83 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:15,925 INFO L241 Difference]: Finished difference. Result has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:15,925 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=602, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2021-03-26 10:07:15,926 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2021-03-26 10:07:15,926 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:15,926 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:15,926 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:15,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:16,147 INFO L129 PetriNetUnfolder]: 865/1577 cut-off events. [2021-03-26 10:07:16,148 INFO L130 PetriNetUnfolder]: For 5685/7264 co-relation queries the response was YES. [2021-03-26 10:07:16,158 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6320 conditions, 1577 events. 865/1577 cut-off events. For 5685/7264 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 10658 event pairs, 302 based on Foata normal form. 33/1411 useless extension candidates. Maximal degree in co-relation 6292. Up to 816 conditions per place. [2021-03-26 10:07:16,179 INFO L142 LiptonReduction]: Number of co-enabled transitions 1302 [2021-03-26 10:07:16,289 INFO L154 LiptonReduction]: Checked pairs total: 939 [2021-03-26 10:07:16,289 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:16,289 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 363 [2021-03-26 10:07:16,290 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:16,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 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) [2021-03-26 10:07:16,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:16,290 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:16,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:07:16,291 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:16,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash -432044064, now seen corresponding path program 1 times [2021-03-26 10:07:16,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:16,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303028258] [2021-03-26 10:07:16,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:16,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:16,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:16,347 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:07:16,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:16,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:16,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303028258] [2021-03-26 10:07:16,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:16,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:07:16,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795926598] [2021-03-26 10:07:16,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:07:16,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:16,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:07:16,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:07:16,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 10:07:16,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 602 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 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) [2021-03-26 10:07:16,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:16,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 10:07:16,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:16,581 INFO L129 PetriNetUnfolder]: 524/1107 cut-off events. [2021-03-26 10:07:16,581 INFO L130 PetriNetUnfolder]: For 5187/8880 co-relation queries the response was YES. [2021-03-26 10:07:16,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4850 conditions, 1107 events. 524/1107 cut-off events. For 5187/8880 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 7695 event pairs, 89 based on Foata normal form. 510/1517 useless extension candidates. Maximal degree in co-relation 4820. Up to 657 conditions per place. [2021-03-26 10:07:16,594 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 11 selfloop transitions, 19 changer transitions 0/86 dead transitions. [2021-03-26 10:07:16,595 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 86 transitions, 738 flow [2021-03-26 10:07:16,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:07:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:07:16,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1284 transitions. [2021-03-26 10:07:16,598 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8693297224102912 [2021-03-26 10:07:16,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1284 transitions. [2021-03-26 10:07:16,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1284 transitions. [2021-03-26 10:07:16,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:16,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1284 transitions. [2021-03-26 10:07:16,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.42857142857142) internal successors, (1284), 7 states have internal predecessors, (1284), 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) [2021-03-26 10:07:16,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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) [2021-03-26 10:07:16,604 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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) [2021-03-26 10:07:16,604 INFO L185 Difference]: Start difference. First operand has 71 places, 73 transitions, 602 flow. Second operand 7 states and 1284 transitions. [2021-03-26 10:07:16,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 86 transitions, 738 flow [2021-03-26 10:07:16,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 700 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:16,614 INFO L241 Difference]: Finished difference. Result has 76 places, 82 transitions, 702 flow [2021-03-26 10:07:16,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=702, PETRI_PLACES=76, PETRI_TRANSITIONS=82} [2021-03-26 10:07:16,615 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 18 predicate places. [2021-03-26 10:07:16,615 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:16,615 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 82 transitions, 702 flow [2021-03-26 10:07:16,615 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 82 transitions, 702 flow [2021-03-26 10:07:16,616 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 82 transitions, 702 flow [2021-03-26 10:07:16,733 INFO L129 PetriNetUnfolder]: 535/1124 cut-off events. [2021-03-26 10:07:16,733 INFO L130 PetriNetUnfolder]: For 6050/9532 co-relation queries the response was YES. [2021-03-26 10:07:16,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 1124 events. 535/1124 cut-off events. For 6050/9532 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 7916 event pairs, 82 based on Foata normal form. 63/1077 useless extension candidates. Maximal degree in co-relation 5394. Up to 663 conditions per place. [2021-03-26 10:07:16,753 INFO L142 LiptonReduction]: Number of co-enabled transitions 1594 [2021-03-26 10:07:16,784 INFO L154 LiptonReduction]: Checked pairs total: 1346 [2021-03-26 10:07:16,784 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:16,784 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 169 [2021-03-26 10:07:16,786 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 82 transitions, 702 flow [2021-03-26 10:07:16,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 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) [2021-03-26 10:07:16,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:16,787 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:07:16,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:07:16,787 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:16,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2092113777, now seen corresponding path program 1 times [2021-03-26 10:07:16,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:16,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328345501] [2021-03-26 10:07:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:16,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:16,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:16,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:16,880 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:07:16,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:16,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:16,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:16,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328345501] [2021-03-26 10:07:16,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:16,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:16,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682028680] [2021-03-26 10:07:16,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:07:16,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:16,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:07:16,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:07:16,894 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 10:07:16,895 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 82 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 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) [2021-03-26 10:07:16,895 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:16,895 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 10:07:16,895 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:17,070 INFO L129 PetriNetUnfolder]: 384/879 cut-off events. [2021-03-26 10:07:17,071 INFO L130 PetriNetUnfolder]: For 6870/14547 co-relation queries the response was YES. [2021-03-26 10:07:17,077 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 879 events. 384/879 cut-off events. For 6870/14547 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6235 event pairs, 13 based on Foata normal form. 685/1479 useless extension candidates. Maximal degree in co-relation 4709. Up to 608 conditions per place. [2021-03-26 10:07:17,082 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 6 selfloop transitions, 28 changer transitions 4/94 dead transitions. [2021-03-26 10:07:17,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 94 transitions, 891 flow [2021-03-26 10:07:17,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:07:17,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:07:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1651 transitions. [2021-03-26 10:07:17,086 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8694049499736703 [2021-03-26 10:07:17,086 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1651 transitions. [2021-03-26 10:07:17,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1651 transitions. [2021-03-26 10:07:17,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:17,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1651 transitions. [2021-03-26 10:07:17,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 183.44444444444446) internal successors, (1651), 9 states have internal predecessors, (1651), 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) [2021-03-26 10:07:17,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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) [2021-03-26 10:07:17,093 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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) [2021-03-26 10:07:17,093 INFO L185 Difference]: Start difference. First operand has 76 places, 82 transitions, 702 flow. Second operand 9 states and 1651 transitions. [2021-03-26 10:07:17,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 94 transitions, 891 flow [2021-03-26 10:07:17,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 94 transitions, 834 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-03-26 10:07:17,111 INFO L241 Difference]: Finished difference. Result has 83 places, 90 transitions, 810 flow [2021-03-26 10:07:17,111 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=810, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2021-03-26 10:07:17,111 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2021-03-26 10:07:17,111 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:17,111 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 90 transitions, 810 flow [2021-03-26 10:07:17,112 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 90 transitions, 810 flow [2021-03-26 10:07:17,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 90 transitions, 810 flow [2021-03-26 10:07:17,202 INFO L129 PetriNetUnfolder]: 366/855 cut-off events. [2021-03-26 10:07:17,202 INFO L130 PetriNetUnfolder]: For 5638/6966 co-relation queries the response was YES. [2021-03-26 10:07:17,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4215 conditions, 855 events. 366/855 cut-off events. For 5638/6966 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6197 event pairs, 12 based on Foata normal form. 33/804 useless extension candidates. Maximal degree in co-relation 4183. Up to 385 conditions per place. [2021-03-26 10:07:17,219 INFO L142 LiptonReduction]: Number of co-enabled transitions 1710 [2021-03-26 10:07:17,283 INFO L154 LiptonReduction]: Checked pairs total: 3039 [2021-03-26 10:07:17,283 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:07:17,283 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 172 [2021-03-26 10:07:17,283 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 87 transitions, 784 flow [2021-03-26 10:07:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 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) [2021-03-26 10:07:17,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:17,284 INFO L263 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] [2021-03-26 10:07:17,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:07:17,284 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash 924595109, now seen corresponding path program 1 times [2021-03-26 10:07:17,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:17,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638001013] [2021-03-26 10:07:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:17,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:17,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:17,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:17,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:17,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:17,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:17,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:17,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:17,382 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-26 10:07:17,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:07:17,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:17,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:17,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638001013] [2021-03-26 10:07:17,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:17,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:07:17,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139063194] [2021-03-26 10:07:17,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:07:17,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:17,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:07:17,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:07:17,418 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 211 [2021-03-26 10:07:17,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 87 transitions, 784 flow. Second operand has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 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) [2021-03-26 10:07:17,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:17,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 211 [2021-03-26 10:07:17,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:17,533 INFO L129 PetriNetUnfolder]: 176/393 cut-off events. [2021-03-26 10:07:17,534 INFO L130 PetriNetUnfolder]: For 2415/3202 co-relation queries the response was YES. [2021-03-26 10:07:17,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 393 events. 176/393 cut-off events. For 2415/3202 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1899 event pairs, 4 based on Foata normal form. 128/494 useless extension candidates. Maximal degree in co-relation 1927. Up to 159 conditions per place. [2021-03-26 10:07:17,539 INFO L132 encePairwiseOnDemand]: 204/211 looper letters, 2 selfloop transitions, 18 changer transitions 4/80 dead transitions. [2021-03-26 10:07:17,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 756 flow [2021-03-26 10:07:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:07:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:07:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1458 transitions. [2021-03-26 10:07:17,542 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8637440758293838 [2021-03-26 10:07:17,543 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1458 transitions. [2021-03-26 10:07:17,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1458 transitions. [2021-03-26 10:07:17,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:17,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1458 transitions. [2021-03-26 10:07:17,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 182.25) internal successors, (1458), 8 states have internal predecessors, (1458), 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) [2021-03-26 10:07:17,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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) [2021-03-26 10:07:17,561 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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) [2021-03-26 10:07:17,561 INFO L185 Difference]: Start difference. First operand has 83 places, 87 transitions, 784 flow. Second operand 8 states and 1458 transitions. [2021-03-26 10:07:17,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 756 flow [2021-03-26 10:07:17,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 80 transitions, 654 flow, removed 39 selfloop flow, removed 10 redundant places. [2021-03-26 10:07:17,569 INFO L241 Difference]: Finished difference. Result has 75 places, 76 transitions, 618 flow [2021-03-26 10:07:17,569 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2021-03-26 10:07:17,570 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2021-03-26 10:07:17,570 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:17,570 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 76 transitions, 618 flow [2021-03-26 10:07:17,570 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 76 transitions, 618 flow [2021-03-26 10:07:17,570 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 76 transitions, 618 flow [2021-03-26 10:07:17,608 INFO L129 PetriNetUnfolder]: 170/385 cut-off events. [2021-03-26 10:07:17,608 INFO L130 PetriNetUnfolder]: For 1211/1653 co-relation queries the response was YES. [2021-03-26 10:07:17,610 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 385 events. 170/385 cut-off events. For 1211/1653 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1925 event pairs, 4 based on Foata normal form. 5/363 useless extension candidates. Maximal degree in co-relation 1622. Up to 125 conditions per place. [2021-03-26 10:07:17,615 INFO L142 LiptonReduction]: Number of co-enabled transitions 1046 [2021-03-26 10:07:18,278 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 186 [2021-03-26 10:07:18,521 WARN L205 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2021-03-26 10:07:19,857 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 341 DAG size of output: 262 [2021-03-26 10:07:20,373 WARN L205 SmtUtils]: Spent 513.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-26 10:07:20,697 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 10:07:20,955 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-26 10:07:21,475 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:07:21,978 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-26 10:07:21,991 INFO L154 LiptonReduction]: Checked pairs total: 3635 [2021-03-26 10:07:21,991 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:07:21,991 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4421 [2021-03-26 10:07:21,992 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 602 flow [2021-03-26 10:07:21,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 179.85714285714286) internal successors, (1259), 7 states have internal predecessors, (1259), 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) [2021-03-26 10:07:21,992 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:21,992 INFO L263 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] [2021-03-26 10:07:21,992 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:07:21,992 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:21,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:21,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1649927179, now seen corresponding path program 1 times [2021-03-26 10:07:21,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:21,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737634490] [2021-03-26 10:07:21,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:22,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:22,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:22,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:22,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737634490] [2021-03-26 10:07:22,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:22,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:22,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474285736] [2021-03-26 10:07:22,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:22,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:22,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:22,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:22,045 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 213 [2021-03-26 10:07:22,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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) [2021-03-26 10:07:22,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:22,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 213 [2021-03-26 10:07:22,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:22,136 INFO L129 PetriNetUnfolder]: 337/704 cut-off events. [2021-03-26 10:07:22,136 INFO L130 PetriNetUnfolder]: For 3043/3776 co-relation queries the response was YES. [2021-03-26 10:07:22,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 704 events. 337/704 cut-off events. For 3043/3776 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4103 event pairs, 8 based on Foata normal form. 70/726 useless extension candidates. Maximal degree in co-relation 2950. Up to 244 conditions per place. [2021-03-26 10:07:22,144 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2021-03-26 10:07:22,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 614 flow [2021-03-26 10:07:22,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 762 transitions. [2021-03-26 10:07:22,147 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8943661971830986 [2021-03-26 10:07:22,147 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 762 transitions. [2021-03-26 10:07:22,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 762 transitions. [2021-03-26 10:07:22,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:22,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 762 transitions. [2021-03-26 10:07:22,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.5) internal successors, (762), 4 states have internal predecessors, (762), 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) [2021-03-26 10:07:22,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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) [2021-03-26 10:07:22,150 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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) [2021-03-26 10:07:22,150 INFO L185 Difference]: Start difference. First operand has 71 places, 73 transitions, 602 flow. Second operand 4 states and 762 transitions. [2021-03-26 10:07:22,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 614 flow [2021-03-26 10:07:22,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 545 flow, removed 19 selfloop flow, removed 8 redundant places. [2021-03-26 10:07:22,162 INFO L241 Difference]: Finished difference. Result has 68 places, 74 transitions, 546 flow [2021-03-26 10:07:22,162 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=546, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2021-03-26 10:07:22,162 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2021-03-26 10:07:22,163 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:22,163 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 74 transitions, 546 flow [2021-03-26 10:07:22,163 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 74 transitions, 546 flow [2021-03-26 10:07:22,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 74 transitions, 546 flow [2021-03-26 10:07:22,255 INFO L129 PetriNetUnfolder]: 337/704 cut-off events. [2021-03-26 10:07:22,255 INFO L130 PetriNetUnfolder]: For 1901/2474 co-relation queries the response was YES. [2021-03-26 10:07:22,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2569 conditions, 704 events. 337/704 cut-off events. For 1901/2474 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4167 event pairs, 6 based on Foata normal form. 38/691 useless extension candidates. Maximal degree in co-relation 2544. Up to 244 conditions per place. [2021-03-26 10:07:22,265 INFO L142 LiptonReduction]: Number of co-enabled transitions 1042 [2021-03-26 10:07:22,289 INFO L154 LiptonReduction]: Checked pairs total: 702 [2021-03-26 10:07:22,289 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:22,290 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 128 [2021-03-26 10:07:22,290 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 546 flow [2021-03-26 10:07:22,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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) [2021-03-26 10:07:22,290 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:22,290 INFO L263 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] [2021-03-26 10:07:22,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:07:22,291 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1002254858, now seen corresponding path program 1 times [2021-03-26 10:07:22,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:22,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109617249] [2021-03-26 10:07:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:22,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:07:22,353 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:07:22,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:07:22,370 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:07:22,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:07:22,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:07:22,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:07:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:22,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109617249] [2021-03-26 10:07:22,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:22,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:07:22,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929140846] [2021-03-26 10:07:22,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:07:22,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:22,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:07:22,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:07:22,405 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 213 [2021-03-26 10:07:22,406 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 546 flow. Second operand has 7 states, 7 states have (on average 158.28571428571428) internal successors, (1108), 7 states have internal predecessors, (1108), 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) [2021-03-26 10:07:22,406 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:22,406 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 213 [2021-03-26 10:07:22,406 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:22,745 INFO L129 PetriNetUnfolder]: 852/1725 cut-off events. [2021-03-26 10:07:22,745 INFO L130 PetriNetUnfolder]: For 6893/7271 co-relation queries the response was YES. [2021-03-26 10:07:22,755 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 1725 events. 852/1725 cut-off events. For 6893/7271 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 12376 event pairs, 12 based on Foata normal form. 156/1797 useless extension candidates. Maximal degree in co-relation 6923. Up to 616 conditions per place. [2021-03-26 10:07:22,762 INFO L132 encePairwiseOnDemand]: 208/213 looper letters, 46 selfloop transitions, 9 changer transitions 60/148 dead transitions. [2021-03-26 10:07:22,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 148 transitions, 1439 flow [2021-03-26 10:07:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:07:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:07:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1290 transitions. [2021-03-26 10:07:22,766 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7570422535211268 [2021-03-26 10:07:22,766 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1290 transitions. [2021-03-26 10:07:22,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1290 transitions. [2021-03-26 10:07:22,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:22,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1290 transitions. [2021-03-26 10:07:22,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 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) [2021-03-26 10:07:22,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 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) [2021-03-26 10:07:22,771 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 213.0) internal successors, (1917), 9 states have internal predecessors, (1917), 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) [2021-03-26 10:07:22,771 INFO L185 Difference]: Start difference. First operand has 68 places, 74 transitions, 546 flow. Second operand 8 states and 1290 transitions. [2021-03-26 10:07:22,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 148 transitions, 1439 flow [2021-03-26 10:07:22,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 148 transitions, 1438 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:07:22,798 INFO L241 Difference]: Finished difference. Result has 77 places, 77 transitions, 607 flow [2021-03-26 10:07:22,799 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=607, PETRI_PLACES=77, PETRI_TRANSITIONS=77} [2021-03-26 10:07:22,799 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2021-03-26 10:07:22,799 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:22,800 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 77 transitions, 607 flow [2021-03-26 10:07:22,800 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 77 transitions, 607 flow [2021-03-26 10:07:22,800 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 77 transitions, 607 flow [2021-03-26 10:07:22,887 INFO L129 PetriNetUnfolder]: 448/982 cut-off events. [2021-03-26 10:07:22,887 INFO L130 PetriNetUnfolder]: For 3323/3977 co-relation queries the response was YES. [2021-03-26 10:07:22,893 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3663 conditions, 982 events. 448/982 cut-off events. For 3323/3977 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6631 event pairs, 8 based on Foata normal form. 68/984 useless extension candidates. Maximal degree in co-relation 3634. Up to 342 conditions per place. [2021-03-26 10:07:22,902 INFO L142 LiptonReduction]: Number of co-enabled transitions 940 [2021-03-26 10:07:22,948 INFO L154 LiptonReduction]: Checked pairs total: 384 [2021-03-26 10:07:22,948 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:07:22,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 149 [2021-03-26 10:07:22,948 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 607 flow [2021-03-26 10:07:22,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 158.28571428571428) internal successors, (1108), 7 states have internal predecessors, (1108), 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) [2021-03-26 10:07:22,949 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:22,949 INFO L263 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] [2021-03-26 10:07:22,949 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:07:22,949 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1598732760, now seen corresponding path program 2 times [2021-03-26 10:07:22,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:22,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206159077] [2021-03-26 10:07:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:07:22,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:07:22,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:22,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:23,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:07:23,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:07:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:07:23,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206159077] [2021-03-26 10:07:23,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:07:23,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:07:23,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885380595] [2021-03-26 10:07:23,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:07:23,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:07:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:07:23,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:07:23,010 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 213 [2021-03-26 10:07:23,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 607 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-03-26 10:07:23,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:07:23,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 213 [2021-03-26 10:07:23,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:07:23,181 INFO L129 PetriNetUnfolder]: 720/1555 cut-off events. [2021-03-26 10:07:23,182 INFO L130 PetriNetUnfolder]: For 6102/7665 co-relation queries the response was YES. [2021-03-26 10:07:23,189 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5739 conditions, 1555 events. 720/1555 cut-off events. For 6102/7665 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 11522 event pairs, 13 based on Foata normal form. 154/1579 useless extension candidates. Maximal degree in co-relation 5708. Up to 523 conditions per place. [2021-03-26 10:07:23,193 INFO L132 encePairwiseOnDemand]: 210/213 looper letters, 3 selfloop transitions, 1 changer transitions 29/78 dead transitions. [2021-03-26 10:07:23,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 78 transitions, 619 flow [2021-03-26 10:07:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:07:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:07:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2021-03-26 10:07:23,196 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8615023474178404 [2021-03-26 10:07:23,196 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2021-03-26 10:07:23,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2021-03-26 10:07:23,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:07:23,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2021-03-26 10:07:23,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 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) [2021-03-26 10:07:23,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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) [2021-03-26 10:07:23,199 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 213.0) internal successors, (1065), 5 states have internal predecessors, (1065), 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) [2021-03-26 10:07:23,199 INFO L185 Difference]: Start difference. First operand has 75 places, 77 transitions, 607 flow. Second operand 4 states and 734 transitions. [2021-03-26 10:07:23,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 78 transitions, 619 flow [2021-03-26 10:07:23,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 616 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:07:23,233 INFO L241 Difference]: Finished difference. Result has 78 places, 49 transitions, 347 flow [2021-03-26 10:07:23,233 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=347, PETRI_PLACES=78, PETRI_TRANSITIONS=49} [2021-03-26 10:07:23,234 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2021-03-26 10:07:23,234 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:07:23,234 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 49 transitions, 347 flow [2021-03-26 10:07:23,234 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 49 transitions, 347 flow [2021-03-26 10:07:23,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 49 transitions, 347 flow [2021-03-26 10:07:23,311 INFO L129 PetriNetUnfolder]: 307/707 cut-off events. [2021-03-26 10:07:23,311 INFO L130 PetriNetUnfolder]: For 1561/2258 co-relation queries the response was YES. [2021-03-26 10:07:23,314 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2564 conditions, 707 events. 307/707 cut-off events. For 1561/2258 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4619 event pairs, 6 based on Foata normal form. 33/681 useless extension candidates. Maximal degree in co-relation 2535. Up to 218 conditions per place. [2021-03-26 10:07:23,321 INFO L142 LiptonReduction]: Number of co-enabled transitions 550 [2021-03-26 10:07:23,450 INFO L154 LiptonReduction]: Checked pairs total: 155 [2021-03-26 10:07:23,450 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:07:23,450 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 216 [2021-03-26 10:07:23,451 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 346 flow [2021-03-26 10:07:23,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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) [2021-03-26 10:07:23,451 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:07:23,451 INFO L263 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] [2021-03-26 10:07:23,451 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:07:23,451 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:07:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:07:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash -211293350, now seen corresponding path program 3 times [2021-03-26 10:07:23,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:07:23,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882524595] [2021-03-26 10:07:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:07:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:07:23,494 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:07:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:07:23,545 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:07:23,587 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:07:23,588 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:07:23,588 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:07:23,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:07:23 BasicIcfg [2021-03-26 10:07:23,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:07:23,713 INFO L168 Benchmark]: Toolchain (without parser) took 29703.30 ms. Allocated memory was 364.9 MB in the beginning and 941.6 MB in the end (delta: 576.7 MB). Free memory was 327.7 MB in the beginning and 821.0 MB in the end (delta: -493.3 MB). Peak memory consumption was 84.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:23,713 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 364.9 MB. Free memory is still 346.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:07:23,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 495.22 ms. Allocated memory is still 364.9 MB. Free memory was 327.5 MB in the beginning and 322.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:23,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 364.9 MB. Free memory was 322.5 MB in the beginning and 319.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:23,714 INFO L168 Benchmark]: Boogie Preprocessor took 34.20 ms. Allocated memory is still 364.9 MB. Free memory was 319.4 MB in the beginning and 316.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:23,714 INFO L168 Benchmark]: RCFGBuilder took 2099.48 ms. Allocated memory is still 364.9 MB. Free memory was 316.3 MB in the beginning and 224.5 MB in the end (delta: 91.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:07:23,714 INFO L168 Benchmark]: TraceAbstraction took 27024.05 ms. Allocated memory was 364.9 MB in the beginning and 941.6 MB in the end (delta: 576.7 MB). Free memory was 224.5 MB in the beginning and 821.0 MB in the end (delta: -596.5 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:07:23,715 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.17 ms. Allocated memory is still 364.9 MB. Free memory is still 346.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 495.22 ms. Allocated memory is still 364.9 MB. Free memory was 327.5 MB in the beginning and 322.5 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.50 ms. Allocated memory is still 364.9 MB. Free memory was 322.5 MB in the beginning and 319.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 34.20 ms. Allocated memory is still 364.9 MB. Free memory was 319.4 MB in the beginning and 316.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2099.48 ms. Allocated memory is still 364.9 MB. Free memory was 316.3 MB in the beginning and 224.5 MB in the end (delta: 91.8 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27024.05 ms. Allocated memory was 364.9 MB in the beginning and 941.6 MB in the end (delta: 576.7 MB). Free memory was 224.5 MB in the beginning and 821.0 MB in the end (delta: -596.5 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8945.8ms, 127 PlacesBefore, 58 PlacesAfterwards, 116 TransitionsBefore, 46 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 5 FixpointIterations, 32 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5149 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2537, positive: 2426, positive conditional: 2426, positive unconditional: 0, negative: 111, negative conditional: 111, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2537, positive: 2426, positive conditional: 0, positive unconditional: 2426, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2537, positive: 2426, positive conditional: 0, positive unconditional: 2426, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1862, positive: 1809, positive conditional: 0, positive unconditional: 1809, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1862, positive: 1801, positive conditional: 0, positive unconditional: 1801, negative: 61, negative conditional: 0, negative unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 969, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 943, negative conditional: 0, negative unconditional: 943, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2537, positive: 617, positive conditional: 0, positive unconditional: 617, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 1862, unknown conditional: 0, unknown unconditional: 1862] , Statistics on independence cache: Total cache size (in pairs): 1862, Positive cache size: 1809, Positive conditional cache size: 0, Positive unconditional cache size: 1809, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3968.3ms, 54 PlacesBefore, 39 PlacesAfterwards, 40 TransitionsBefore, 28 TransitionsAfterwards, 482 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 2033 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 598, positive: 492, positive conditional: 492, positive unconditional: 0, negative: 106, negative conditional: 106, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 598, positive: 492, positive conditional: 8, positive unconditional: 484, negative: 106, negative conditional: 4, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 598, positive: 492, positive conditional: 8, positive unconditional: 484, negative: 106, negative conditional: 4, negative unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 123, positive: 99, positive conditional: 1, positive unconditional: 98, negative: 24, negative conditional: 2, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 123, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 31, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 24, negative conditional: 2, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 522, positive: 82, positive conditional: 0, positive unconditional: 82, negative: 439, negative conditional: 39, negative unconditional: 400, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 598, positive: 393, positive conditional: 7, positive unconditional: 386, negative: 82, negative conditional: 2, negative unconditional: 80, unknown: 123, unknown conditional: 3, unknown unconditional: 120] , Statistics on independence cache: Total cache size (in pairs): 1985, Positive cache size: 1908, Positive conditional cache size: 1, Positive unconditional cache size: 1907, Negative cache size: 77, Negative conditional cache size: 2, Negative unconditional cache size: 75, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1147.1ms, 40 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 930 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 229, positive: 177, positive conditional: 177, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 229, positive: 177, positive conditional: 0, positive unconditional: 177, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 229, positive: 177, positive conditional: 0, positive unconditional: 177, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 229, positive: 176, positive conditional: 0, positive unconditional: 176, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1987, Positive cache size: 1909, Positive conditional cache size: 1, Positive unconditional cache size: 1908, Negative cache size: 78, Negative conditional cache size: 2, Negative unconditional cache size: 76, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0ms, 40 PlacesBefore, 40 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 326 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, positive: 79, positive conditional: 2, positive unconditional: 77, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 79, positive conditional: 2, positive unconditional: 77, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 69, positive conditional: 2, positive unconditional: 67, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1997, Positive cache size: 1919, Positive conditional cache size: 1, Positive unconditional cache size: 1918, Negative cache size: 78, Negative conditional cache size: 2, Negative unconditional cache size: 76, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 94.5ms, 46 PlacesBefore, 46 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 522 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 204, positive: 182, positive conditional: 182, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 204, positive: 182, positive conditional: 46, positive unconditional: 136, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 204, positive: 182, positive conditional: 46, positive unconditional: 136, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 10, positive unconditional: 15, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 204, positive: 157, positive conditional: 36, positive unconditional: 121, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 27, unknown conditional: 12, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 2024, Positive cache size: 1944, Positive conditional cache size: 11, Positive unconditional cache size: 1933, Negative cache size: 80, Negative conditional cache size: 4, Negative unconditional cache size: 76, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.8ms, 51 PlacesBefore, 51 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 780 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 299, positive: 271, positive conditional: 271, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 300, positive: 271, positive conditional: 85, positive unconditional: 186, negative: 29, negative conditional: 3, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 300, positive: 271, positive conditional: 85, positive unconditional: 186, negative: 29, negative conditional: 3, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 1, positive unconditional: 5, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 300, positive: 265, positive conditional: 84, positive unconditional: 181, negative: 28, negative conditional: 2, negative unconditional: 26, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2031, Positive cache size: 1950, Positive conditional cache size: 12, Positive unconditional cache size: 1938, Negative cache size: 81, Negative conditional cache size: 5, Negative unconditional cache size: 76, Eliminated conditions: 43 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 105.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 197, positive: 169, positive conditional: 169, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 198, positive: 169, positive conditional: 52, positive unconditional: 117, negative: 29, negative conditional: 3, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 198, positive: 169, positive conditional: 52, positive unconditional: 117, negative: 29, negative conditional: 3, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 198, positive: 168, positive conditional: 52, positive unconditional: 116, negative: 27, negative conditional: 3, negative unconditional: 24, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2034, Positive cache size: 1951, Positive conditional cache size: 12, Positive unconditional cache size: 1939, Negative cache size: 83, Negative conditional cache size: 5, Negative unconditional cache size: 78, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 117.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 842 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1127 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 414, positive: 379, positive conditional: 379, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 415, positive: 379, positive conditional: 162, positive unconditional: 217, negative: 36, negative conditional: 3, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 415, positive: 379, positive conditional: 162, positive unconditional: 217, negative: 36, negative conditional: 3, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 6, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 415, positive: 365, positive conditional: 156, positive unconditional: 209, negative: 36, negative conditional: 3, negative unconditional: 33, unknown: 14, unknown conditional: 6, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2048, Positive cache size: 1965, Positive conditional cache size: 18, Positive unconditional cache size: 1947, Negative cache size: 83, Negative conditional cache size: 5, Negative unconditional cache size: 78, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 993.5ms, 63 PlacesBefore, 63 PlacesAfterwards, 63 TransitionsBefore, 63 TransitionsAfterwards, 914 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 2340 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 699, positive: 634, positive conditional: 634, positive unconditional: 0, negative: 65, negative conditional: 65, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 701, positive: 634, positive conditional: 331, positive unconditional: 303, negative: 67, negative conditional: 3, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 701, positive: 634, positive conditional: 331, positive unconditional: 303, negative: 67, negative conditional: 3, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 701, positive: 631, positive conditional: 328, positive unconditional: 303, negative: 67, negative conditional: 3, negative unconditional: 64, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2051, Positive cache size: 1968, Positive conditional cache size: 21, Positive unconditional cache size: 1947, Negative cache size: 83, Negative conditional cache size: 5, Negative unconditional cache size: 78, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 253.7ms, 66 PlacesBefore, 66 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 864 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 227, positive: 207, positive conditional: 207, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 227, positive: 207, positive conditional: 90, positive unconditional: 117, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 227, positive: 207, positive conditional: 90, positive unconditional: 117, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 11, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 227, positive: 191, positive conditional: 79, positive unconditional: 112, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 16, unknown conditional: 11, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2067, Positive cache size: 1984, Positive conditional cache size: 32, Positive unconditional cache size: 1952, Negative cache size: 83, Negative conditional cache size: 5, Negative unconditional cache size: 78, Eliminated conditions: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 363.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 73 TransitionsBefore, 73 TransitionsAfterwards, 1302 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 939 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 165, positive: 144, positive conditional: 144, positive unconditional: 0, negative: 21, negative conditional: 21, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 165, positive: 144, positive conditional: 69, positive unconditional: 75, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 165, positive: 144, positive conditional: 69, positive unconditional: 75, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 165, positive: 144, positive conditional: 69, positive unconditional: 75, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2069, Positive cache size: 1984, Positive conditional cache size: 32, Positive unconditional cache size: 1952, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 168.7ms, 76 PlacesBefore, 76 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 1594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1346 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 371, positive: 345, positive conditional: 345, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 371, positive: 345, positive conditional: 243, positive unconditional: 102, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 371, positive: 345, positive conditional: 243, positive unconditional: 102, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 371, positive: 336, positive conditional: 234, positive unconditional: 102, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2078, Positive cache size: 1993, Positive conditional cache size: 41, Positive unconditional cache size: 1952, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 171.3ms, 83 PlacesBefore, 83 PlacesAfterwards, 90 TransitionsBefore, 87 TransitionsAfterwards, 1710 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 3039 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1004, positive: 950, positive conditional: 950, positive unconditional: 0, negative: 54, negative conditional: 54, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1004, positive: 950, positive conditional: 652, positive unconditional: 298, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1004, positive: 950, positive conditional: 652, positive unconditional: 298, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 10, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1004, positive: 939, positive conditional: 642, positive unconditional: 297, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2089, Positive cache size: 2004, Positive conditional cache size: 51, Positive unconditional cache size: 1953, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 88 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4421.0ms, 75 PlacesBefore, 71 PlacesAfterwards, 76 TransitionsBefore, 73 TransitionsAfterwards, 1046 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 3635 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2001, positive: 1914, positive conditional: 1914, positive unconditional: 0, negative: 87, negative conditional: 87, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2001, positive: 1914, positive conditional: 1427, positive unconditional: 487, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2001, positive: 1914, positive conditional: 1427, positive unconditional: 487, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 17, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2001, positive: 1894, positive conditional: 1410, positive unconditional: 484, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 20, unknown conditional: 17, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2109, Positive cache size: 2024, Positive conditional cache size: 68, Positive unconditional cache size: 1956, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 178 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 126.6ms, 68 PlacesBefore, 68 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 1042 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 702 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 429, positive: 413, positive conditional: 413, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 429, positive: 413, positive conditional: 315, positive unconditional: 98, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 429, positive: 413, positive conditional: 315, positive unconditional: 98, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 429, positive: 407, positive conditional: 309, positive unconditional: 98, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2115, Positive cache size: 2030, Positive conditional cache size: 74, Positive unconditional cache size: 1956, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.9ms, 77 PlacesBefore, 75 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 940 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 384 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 231, positive: 222, positive conditional: 162, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 231, positive: 222, positive conditional: 162, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 231, positive: 222, positive conditional: 162, positive unconditional: 60, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2115, Positive cache size: 2030, Positive conditional cache size: 74, Positive unconditional cache size: 1956, Negative cache size: 85, Negative conditional cache size: 5, Negative unconditional cache size: 80, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 215.8ms, 78 PlacesBefore, 70 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 155 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 108, positive conditional: 108, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 108, positive conditional: 59, positive unconditional: 49, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 108, positive conditional: 59, positive unconditional: 49, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 10, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 93, positive conditional: 49, positive unconditional: 44, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 17, unknown conditional: 10, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2132, Positive cache size: 2045, Positive conditional cache size: 84, Positive unconditional cache size: 1961, Negative cache size: 87, Negative conditional cache size: 5, Negative unconditional cache size: 82, Eliminated conditions: 35 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L824] 4 z = 1 [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L757] 1 x = 1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L883] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L884] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L885] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L887] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L888] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 119 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26788.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3282.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9026.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 43 SDslu, 27 SDs, 0 SdLazy, 566 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 640.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 499.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=810occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 59.1ms SsaConstructionTime, 530.0ms SatisfiabilityAnalysisTime, 1137.7ms InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 1671 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! Received shutdown request...